Related papers: Linear Codes associated to Determinantal Varieties
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
Let $F^n$ be the binary $n$-cube, or binary Hamming space of dimension $n$, endowed with the Hamming distance, and ${\cal E}^n$ (respectively, ${\cal O}^n$) the set of vectors with even (respectively, odd) weight. For $r\geq 1$ and $x\in…
By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…
Few-weight codes have been constructed and studied for many years, since their fascinating relations to finite geometries, strongly regular graphs and Boolean functions. Simplex codes are one-weight Griesmer $[\frac{q^k-1}{q-1},k…
In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…
Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…
A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…
A classical method of constructing a linear code over $\gf(q)$ with a $t$-design is to use the incidence matrix of the $t$-design as a generator matrix over $\gf(q)$ of the code. This approach has been extensively investigated in the…
This paper has two goals. The first one is to discuss good codes for packing problems in the Lee and Manhattan metrics. The second one is to consider weighing matrices for some of these coding problems. Weighing matrices were considered as…
We use computer algebra to determine the ranks of arrays of size 2 x 2 x 2 and 2 x 2 x 2 x 2 with entries in the set {0, 1} regarded as a field with two elements, as a Boolean algebra, and as non-negative integers. In the field case we also…
Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex…
Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…
We investigate the maximum number \( L_{\mathrm{rk}}(n, m, k, q) \) of distinct nonzero rank weights that an \( \mathbb{F}_{q^m} \)-linear rank-metric code of dimension \( k \) in \( \mathbb{F}_{q^m}^n \) can attain. We determine the exact…
The paper presents a method to generate some families of linear codes over finite fields of characteristics greater than two in the widest class due to the size of Grassmann manifold, i.e. when the dimension is equal to codimension. Our…
We study the rank weight hierarchy of linear codes which are stable under a linear endomorphism defined over the base field, in particular when the endomorphism is cyclic. In this last case, we give a necessary and sufficient condition for…
A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…
Combinatorial $t$-designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and $t$-designs has been…
Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…
While dealing with the nontrivial task of classifying Mueller matrices, of special interest is the study of the degenerate Mueller matrices (matrices with vanishing determinant, for which the law of multiplication holds, but there exists no…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…