相关论文: A further study on the mass formula for linear cod…

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Folded Reed-Solomon codes, introduced by Guruswami and Rudra in 2007, have been shown to achieve the information-theoretically best possible trade-off between the rate of a code and the error-correction radius. In 2024, Bergamaschi,…

Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So…

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…

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Let $\mathcal{H}$ be the Hermitian curve defined over a finite field $\mathbb{F}_{q^2}$. In this paper we complete the geometrical characterization of the supports of the minimum-weight codewords of the algebraic-geometry codes over…

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the $b$-symbol distance spectrum. We examine this question for…

In this note, we establish a mass formula for self-orthogonal codes over Z_{p^2}, where p is a prime. As a consequence, an alternative proof of the known mass formulas for self-dual codes over Z_{p^2} is obtained. We also establish a mass…

Keeping in view the ordering ambiguity that arises due to the presence of position-dependent effective mass in the kinetic energy term of the Hamiltonian, a general scheme for obtaining algebraic solutions of quantum mechanical systems with…

In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…

A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…

We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a…

The microscopic spectral density of the Hermitian Wilson-Dirac operator is computed numerically in quenched lattice QCD. We demonstrate that the results given for fixed index of the Wilson-Dirac operator can be matched by the predictions…

The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

We derive the loop equations for the one Hermitian matrix model in any dimension. These are a consequence of the Schwinger-Dyson equations of the model. Moreover we show that in leading order of large $N$ the loop equations form a closed…

We study the dual linear code of points and generators on a non-singular Hermitian variety $\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$…

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

We prove that if $n >k^2$ then a $k$-dimensional linear code of length $n$ over ${\mathbb F}_{q^2}$ has a truncation which is linearly equivalent to a Hermitian self-orthogonal linear code. In the contrary case we prove that truncations of…