English
Related papers

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

200 papers

Hermitian linear complementary dual codes are linear codes whose intersection with their Hermitian dual code is trivial. The largest minimum weight among quaternary Hermitian linear complementary dual codes of dimension $2$ is known for…

Combinatorics · Mathematics 2020-04-21 Keita Ishizuka

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

Let C be an extremal binary doubly even self-dual code of length n and s(C) denote the largest integer t such that the support design of C holds a t-design for some weight. In this paper, we prove s(C) \leq 7.

Combinatorics · Mathematics 2014-04-08 Tsuyoshi Miezaki , Hiroyuki Nakasora

In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…

Information Theory · Computer Science 2019-12-16 Wenpeng Gao , Tongjiang Yan

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…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada

It is shown that the extended quadratic residue code of length 20 over GF(7) is a unique self-dual [20,10,9] code C such that the lattice obtained from C by Construction A is isomorphic to the 20-dimensional unimodular lattice D_{20}^+, up…

Combinatorics · Mathematics 2016-08-19 Masaaki Harada , Akihiro Munemasa

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

Let $t \in \{2,8,10,12,14,16,18\}$ and $n=31s+t\geq 14$, $d_{a}(n,5)$ and $d_{l}(n,5)$ be distances of binary $[n,5]$ optimal linear codes and optimal linear complementary dual (LCD) codes, respectively. We show that an $[n,5,d_{a}(n,5)]$…

Information Theory · Computer Science 2024-09-26 Yang Liu , Ruihu Li , Qiang Fu , Hao Song

The existence of an extremal code of length 72 is a long-standing open problem. Let C be a putative extremal code of length 72 and suppose that C has an automorphism g of order 6. We show that C, as an F_2<g>-module, is the direct sum of…

Information Theory · Computer Science 2012-09-26 Martino Borello

In this paper, we introduce and investigate the neighborhood of binary self-dual codes. We prove that there is no better Type I code than the best Type II code of the same length. Further, we give some new necessary conditions for the…

Information Theory · Computer Science 2023-01-18 Carolin Hannusch , S. Roland Major

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…

Information Theory · Computer Science 2026-05-12 Patrick King , Mikhail Kotchetov

An $s$-extremal optimal unimodular lattice in dimension $52$ is constructed for the first time. This lattice is constructed from a certain self-dual $\mathbb{F}_5$-code by Construction A. In addition, as neighbors of the lattice, two more…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

Linear complementary dual (LCD) codes can be used to against side-channel attacks and fault noninvasive attacks. Let $d_{a}(n,6)$ and $d_{l}(n,6)$ be the minimum weights of all binary optimal linear codes and LCD codes with length $n$ and…

Information Theory · Computer Science 2024-09-26 Yang Liu , Ruihu Li

For $(n,d)= (66,17),(78,19)$ and $(94,21)$, we construct quantum $[[n,0,d]]$ codes which improve the previously known lower bounds on the largest minimum weights among quantum codes with these parameters. These codes are constructed from…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Alexander Tylyshchak , Bahattin Yildiz

In this paper, we study self-dual codes over $\mathbb{Z}_2 \times (\mathbb{Z}_2+u\mathbb{Z}_2) $, where $u^2=0$. Three types of self-dual codes are defined. For each type, the possible values $\alpha,\beta$ such that there exists a code…

Information Theory · Computer Science 2016-10-05 Long Yu , Qiong Huang , Hongwei Liu , Xiusheng Liu

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…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Bahattin Yildiz

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…

Combinatorics · Mathematics 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

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.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura