English
Related papers

Related papers: There exists no self-dual [24,12,10] code over F5

200 papers

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…

Combinatorics · Mathematics 2008-01-09 Lars Eirik Danielsen , Matthew G. Parker

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\mathbb{F}_q$ having large minimum weights for $q \in \{2,3\}$. Using the characterization, we…

Combinatorics · Mathematics 2021-01-05 Makoto Araya , Masaaki Harada , Ken Saito

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…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada , Ken Saito

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.

Combinatorics · Mathematics 2013-11-12 Naoyuki Horiguchi , Tsuyoshi Miezaki , Hiroyuki Nakasora

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…

Combinatorics · Mathematics 2015-09-18 Masaaki Harada

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…

Information Theory · Computer Science 2016-11-18 Iliya Bouyukliev , Erik Jakobsson

A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72 that has an automorphism group containing D10, Z3xZ3, or Z7. Combining this with the known results in the literature one obtains that…

Information Theory · Computer Science 2012-03-14 Thomas Feulner , Gabriele Nebe

In this note, we investigate the performance of optimal double circulant even codes which are not self-dual, as measured by the decoding error probability in bounded distance decoding. To do this, we classify the optimal double circulant…

Combinatorics · Mathematics 2016-08-26 T. Aaron Gulliver , Masaaki Harada

The structure of binary self-dual codes invariant under the action of a cyclic group of order $pq$ for odd primes $p\neq q$ is considered. As an application we prove the nonexistence of an extremal self-dual $[96, 48, 20]$ code with an…

Information Theory · Computer Science 2016-05-03 Stefka Bouyuklieva , Wolfgang Willems , Nikolay Yankov

It has been proven in a series of works that the order of the automorphism group of a binary [72,36,16] code does not exceed five. We obtain a parametrization of all self-dual binary codes of length 72 with automorphism of order 4 which can…

Combinatorics · Mathematics 2014-06-10 Vassil Yorgov , Daniel Yorgov

A classification of extremal double circulant self-dual codes of lengths up to $88$ is known. We give a classification of extremal double circulant self-dual codes of lengths $90,92,94$ and $96$. We also classify double circulant self-dual…

Combinatorics · Mathematics 2017-03-22 T. Aaron Gulliver , Masaaki Harada

We give restrictions on the weight enumerators of ternary near-extremal self-dual codes of length divisible by $12$ and quaternary near-extremal Hermitian self-dual codes of length divisible by $6$. We consider the weight enumerators for…

Information Theory · Computer Science 2022-12-05 Makoto Araya , Masaaki Harada

In this paper, binary extremal singly even self-dual codes of length 40 and extremal odd unimodular lattices in dimension 40 are studied. We give a classification of extremal singly even self-dual codes of length 40. We also give a…

Combinatorics · Mathematics 2013-02-19 Stefka Bouyuklieva , Iliya Bouyukliev , Masaaki Harada

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…

Information Theory · Computer Science 2012-10-23 Finley Freibert , Jon-Lark Kim

The weight distribution of the binary self-dual $[128,64]$ code being the extended code $C^{*}$ of the code $C$ spanned by the incidence vectors of the blocks of the polarity design in $PG(6,2)$ [11] is computed. It is shown also that…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Ethan Novak , Vladimir D. Tonchev

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…

Combinatorics · Mathematics 2020-12-22 Tsuyoshi Miezaki , Akihiro Munemasa , Hiroyuki Nakasora

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…

Combinatorics · Mathematics 2012-07-24 Lars Eirik Danielsen

A computer calculation with Magma shows that there is no extremal self-dual binary code C of length 72, whose automorphism group contains the symmetric group of degree 3, the alternating group of degree 4 or the dihedral group of order 8.…

Information Theory · Computer Science 2013-07-05 Martino Borello , Francesca Dalla Volta , Gabriele Nebe

We complete the building-up construction for self-dual codes by resolving the open cases over $GF(q)$ with $q \equiv 3 \pmod 4$, and over $\Z_{p^m}$ and Galois rings $\GR(p^m,r)$ with an odd prime $p$ satisfying $p \equiv 3 \pmod 4$ with…

Information Theory · Computer Science 2012-01-30 Yoonjin Lee , Jon-Lark Kim

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.

Information Theory · Computer Science 2025-07-04 Masaaki Harada