Related papers: Generalized rank weights : a duality statement
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. Fundamental bounds, some explicit or…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
The universal secure network coding presented by Silva et al. realizes secure and reliable transmission of a secret message over any underlying network code, by using maximum rank distance codes. Inspired by their result, this paper…
A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
We generalize the Brouwer-Zimmermann algorithm, which is the most efficient general algorithm for computing the minimum distance of a random linear code, to the case of generalized Hamming weights. We also adapt this algorithm to compute…
In this paper, generalized metrics mean metrics taking values in general linearly ordered Abelian groups. Using the Hahn fields, we first prove that for every generalized metric space, if the set of the Archimedean equivalence classes of…
The objective of this paper is to construct a class of linear codes with two nonzero weights and three nonzero weights by using the general trace functions, which weight distributions has been determined. These linear codes contain some…
In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…
In this note, we give a very simple description of the generalized Hamming weights of Reed--Muller codes. For this purpose, we generalize the well-known Macaulay representation of a nonnegative integer and state some of its basic…
We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…
The $r$-th generalized Hamming metric and the $b$-symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of the reading…
In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…
Wachter-Zeh in [42], and later together with Raviv [31], proved that Gabidulin codes cannot be efficiently list decoded for any radius $\tau$, providing that $\tau$ is large enough. Also, they proved that there are infinitely many choices…
We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…
A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
Coding Theory where the alphabet is identified with the elements of a ring or a module has become an important research topic over the last 30 years. Such codes over rings had important applications and many interesting mathematical…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…