Related papers: Average of complete joint weight enumerators and s…
The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with…
In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…
Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can be expressed as the form of a linear combination of…
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence…
This paper investigates the relation between linear codes and the stabilizer in ${\rm GL}_2(\mathbb{C})$ of their weight enumerators. We prove a result on the finiteness of stabilizers and give a complete classification of linear codes with…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
Error-correcting codes are known to define chiral 2d lattice CFTs where all the $U(1)$ symmetries are enhanced to $SU(2)$. In this paper, we extend this construction to a broader class of length-$n$ codes which define full (non-chiral) CFTs…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the…
The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a…
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…
For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…
In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…
Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…
The joint probability distribution in the full counting statistics (FCS) for noninteracting electrons is discussed for an arbitrary number of initially separate subsystems which are connected at t=0 and separated at a later time. A simple…