Related papers: Geometric approach to the MacWilliams Extension Th…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
We study the algebraic geometry of a family of evaluation codes from plane smooth curves defined over any field. In particular, we provide a cohomological characterization of their dual minimum distance. After having discussed some general…
In this paper, we provide a thorough study on the expansion of single trace Einstein-Yang-Mills amplitudes into linear combination of color-ordered Yang-Mills amplitudes, from various different perspectives. Using the gauge invariance…
We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…
In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…
We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
Linear codes over finite extension fields have widespread applications in theory and practice. In some scenarios, the decoder has a sequential access to the codeword symbols, giving rise to a hierarchical erasure structure. In this paper we…
In this paper, we obtain two extension theorems for cohomology classes and holomorphic sections defined on analytic subvarieties, which are defined as the supports of the quotient sheaves of multiplier ideal sheaves of…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
For a given linear code $\C$ of length $n$ over $\gf(q)$ and a nonzero vector $\bu$ in $\gf(q)^n$, Sun, Ding and Chen defined an extended linear code $\overline{\C}(\bu)$ of $\C$, which is a generalisation of the classical extended code…
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…
The mds (maximum distance separable) conjecture claims that a nontrivial linear mds $[n,k]$ code over the finite field $GF(q)$ satisfies $n \leq (q + 1)$, except when $q$ is even and $k = 3$ or $k = q- 1$ in which case it satisfies $n \leq…
We prove that the isomorphism problem for group algebras reduces to group algebras over finite extensions of the prime field. In particular, the modular isomorphism problem reduces to finite modular group algebras.
We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.
Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…
In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We…
In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…
We investigate the structure of intersecting error-correcting codes, with a particular focus on their connection to matroid theory. We establish properties and bounds for intersecting codes with the Hamming metric and illustrate how these…