Related papers: On triply even binary codes
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of…
By the Assmus and Mattson theorem, the codewords of each nontrivial weight in an extremal doubly even self-dual code of length 24m form a self-orthogonal 5-design. In this paper, we study the codes constructed from self-orthogonal 5-designs…
From a given $[n, k]$ code $C$, we give a method for constructing many $[n, k]$ codes $C'$ such that the hull dimensions of $C$ and $C'$ are identical. This method can be applied to constructions of both self-dual codes and linear…
In this work, we generalize the four circulant construction for self-dual codes. By applying the constructions over the alphabets F_2, F_2 + uF_2, F_4+uF_4, we were able to obtain extremal binary self-dual codes of lengths 40, 64 including…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
We construct new $s$-extremal singly even self-dual codes of minimum weights $8,10,12$ and $14$. We also give tables for the currently known results on the existence of $s$-extremal singly even self-dual codes of minimum weights $8,10,12$…
In this work, quadratic double and quadratic bordered double circulant constructions are applied to F_4 + uF_4 as well as F_4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension…
In this paper we classify all extremal and $s$-extremal binary self-dual codes of length 38. There are exactly 2744 extremal $[38,19,8]$ self-dual codes, two $s$-extremal $[38,19,6]$ codes, and 1730 $s$-extremal $[38,19,8]$ codes. We obtain…
Currently, the existence of an extremal singly even self-dual code of length $24k+10$ is unknown for all nonnegative integers $k$. In this note, we study singly even self-dual $[24k+10,12k+5,4k+2]$ codes. We give some restrictions on the…
For lengths $64$ and $66$, we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist. We also construct new $40$ inequivalent extremal doubly…
Let D be the support design of the minimum weight of an extremal binary doubly even self-dual [24m,12m,4m+4] code. In this note, we consider the case when D becomes a t-design with t \geq 6.
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…
For lengths $36$, $48$ and $60$, we construct new ternary near-extremal self-dual codes with weight enumerators for which no ternary near-extremal self-dual codes were previously known to exist.
Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the…
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon codes, and Reed-Muller codes have nice decoding algorithms.…
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 work, we apply the idea of composite matrices arising from group rings to derive a number of different techniques for constructing self-dual codes over finite commutative Frobenius rings. By applying these techniques over different…
In this paper, we determine the dimensions of the residue codes of extremal Type II Z4-codes for lengths 32 and 40. We demonstrate that every binary doubly even self-dual code of length 32 can be realized as the residue code of some…
The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification,…