Related papers: Z4-Linear Perfect Codes
If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of…
In this note, we study the classification of $\mathbb{Z}_4$-codes. For some special cases $(k_1,k_2)$, by hand, we give a classification of $\mathbb{Z}_4$-codes of length $n$ and type $4^{k_1}2^{k_2}$ satisfying a certain condition. Our…
It is proven that for any numbers n=2^m-1, m >= 4 and r, such that n - log(n+1)<= r <= n excluding n = r = 63, n = 127, r in {126,127} and n = r = 2047 there exists a propelinear perfect binary code of length n and rank r.
A code C is Z2Z4-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary…
We consider the symmetry group of a $Z_2Z_4$-linear code with parameters of a $1$-perfect, extended $1$-perfect, or Preparata-like code. We show that, provided the code length is greater than $16$, this group consists only of symmetries…
All codes with minimum distance 8 and codimension up to 14 and all codes with minimum distance 10 and codimension up to 18 are classified. Nonexistence of codes with parameters [33,18,8] and [33,14,10] is proved. This leads to 8 new exact…
Let ${\cal C}$ be a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code of length $n > 3$. We prove that if the binary Gray image of ${\cal C}$, $C=\Phi({\cal C})$, is a 1-perfect nonlinear code, then ${\cal C}$ cannot be a…
We investigate perfect codes in $\mathbb{Z}^n$ under the $\ell_p$ metric. Upper bounds for the packing radius $r$ of a linear perfect code, in terms of the metric parameter $p$ and the dimension $n$ are derived. For $p = 2$ and $n = 2, 3$,…
Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…
A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear…
The paper proves that there exist an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov…
A binary code of blocklength $n$ and codebook size $M$ is called an $(n,M)$ code, which is studied for memoryless binary symmetric channels (BSCs) with the maximum likelihood (ML) decoding. For any $n \geq 2$, some optimal codes among the…
In this paper, an explicit representation and enumeration for negacyclic codes of length $2^kn$ over the local non-principal ideal ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$ $(u^2=0)$ is provided, where $k, n$ are any positive integers and $n$ is…
We study $1$-perfect codes in Doob graphs $D(m,n)$. We show that such codes that are linear over $GR(4^2)$ exist if and only if $n=(4^{g+d}-1)/3$ and $m=(4^{g+2d}-4^{g+d})/6$ for some integers $g \ge 0$ and $d>0$. We also prove necessary…
For lengths 8,16 and 24, it is known that there is an extremal Type II Z2k-code for every positive integer k. In this paper, we show that there is an extremal Type II Z2k-code of lengths 32,40,48,56 and 64 for every positive integer k. For…
The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…
Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-correcting Lee codes. In this paper we deal with the existence…
We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…
We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.
We study codes with parameters of the ternary Hamming $(n=(3^m-1)/2,3^{n-m},3)$ code, i.e., ternary $1$-perfect codes. The rank of the code is defined to be the dimension of its affine span. We characterize ternary $1$-perfect codes of rank…