Related papers: On triply even binary codes
A complete classification of binary doubly even self-dual codes of length 40 is given. As a consequence, a classification of binary extremal self-dual codes of length 38 is also given.
In this paper, we present examples of codes all of whose weight classes support 1-designs, with duals whose classes include two that support 2-designs. We can find these examples in the triply even binary codes of length 48, which have been…
It is shown that there does not exist a binary projective triply-even code of length $59$. This settles the last open length for projective triply-even binary codes. Therefore, projective triply-even binary codes exist precisely for lengths…
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…
In this note, we construct new doubly even self-dual codes having minimum weight $20$ for lengths $112$, $120$ and $128$. This implies that there are at least three inequivalent extremal doubly even self-dual codes of length $112$.
In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…
In this note, we demonstrate that every binary doubly even self-dual code of length $40$ can be realized as the residue code of some extremal Type II $\mathbb{Z}_4$-code. As a consequence, it is shown that there are at least $94356$…
We give a classification of four-circulant singly even self-dual $[60,30,d]$ codes for $d=10$ and $12$. These codes are used to construct extremal singly even self-dual $[60,30,12]$ codes with weight enumerator for which no extremal singly…
All extremal ternary codes of length 48 that have some automorphism of prime order $p\geq 5$ are equivalent to one of the two known codes, the Pless code or the extended quadratic residue code.
We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.
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…
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…
We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
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…
It is shown that the residue code of a self-dual $\mathbb{Z}_4$-code of length $24k$ (resp.\ $24k+8$) and minimum Lee weight $8k+4 \text{ or }8k+2$ (resp.\ $8k+8 \text{ or }8k+6$) is a binary extremal doubly even self-dual code for every…
An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.
We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent.
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…