相关论文: Higher Weights of Affine Grassmann Codes and Their…

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Let $\Lambda$ be a dominant integral weight of level $k$ for the affine Lie algebra $\mathfrak g$ and let $\alpha$ be a non-negative integral combination of simple roots. We address the question of whether the weight $\eta=\Lambda-\alpha$…

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit closed formulas. Similarly, explicit closed formulas for the multiplicities of…

In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…

Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…

In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal…

In this paper we investigate the exactness of the Grassmannian BGG complexes introduced in a previous work (arXiv:1211.2486), and obtain some inequalities between some Hodge numbers of some irregular varieties. In particular, we obtain…

We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…

In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m=6 this was done by Nogin. We derive a formula for the weight of a codeword of C(3,m), in terms…

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…

One can realize higher laminations as positive configurations of points in the affine building. The duality pairings of Fock and Goncharov give pairings between higher laminations for two Langlands dual groups $G$ and $G^{\vee}$. These…

Affine Cartesian codes were first discussed by Geil and Thomsen in 2013 in a broader framework and were formally introduced by L\'opez, Renter\'ia-M\'arquez and Villarreal in 2014. These are linear error-correcting codes obtained by…

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus,…

Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…

Polar codes can be viewed as decreasing monomial codes, revealing a rich algebraic structure governed by the lower-triangular affine (LTA) group. We develop a general framework to compute the Hamming weight of codewords generated by sums of…

We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in [12, Ex. 3.2]. Among the codes that we construct almost all have parameters as good as the best known…

Let $p$ be a prime number and $s> 0$ an integer. In this short note, we investigate one-point geometric Goppa codes associated with an elementary abelian $p$-extension of $\mathbb{F}_{p^{s}}(x)$. We determine their dimension and the exact…

Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…