English
Related papers

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

200 papers

In this paper, we determine all self-dual codes over $F_p+vF_p$ ($v^2=v$) in terms of self-dual codes over the finite field $F_p$ and give an explicit construction for self-dual codes over $F_p+vF_p$, where $p$ is a prime.

Information Theory · Computer Science 2013-04-18 Guanghui Zhang , Bocong Chen

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…

Discrete Mathematics · Computer Science 2011-11-02 Carlos Aguilar-Melchor , Philippe Gaborit , Jon-Lark Kim , Lin Sok , Patrick Solé

We introduce quaternary modified four $\mu$-circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $\mu$-circulant Hermitian self-dual codes. We also construct quaternary modified…

Information Theory · Computer Science 2024-01-30 Masaaki Harada

We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a…

Information Theory · Computer Science 2020-11-20 Masaaki Harada , Ken Saito

Previously, self-dual codes have been constructed from weighing matrices, and in particular from conference matrices (skew and symmetric). In this paper, codes constructed from matrices of skew symmetric type whose determinants reach the…

Information Theory · Computer Science 2013-11-13 José Andrés Armario , María Dolores Frau

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

In [9], the codewords of small weight in the dual code of the code of points and lines of Q(4, q) are characterised. Inspired by this result, using geometrical arguments, we characterise the codewords of small weight in the dual code of the…

Combinatorics · Mathematics 2012-01-17 Valentina Pepe , Leo Storme , Geertrui Van de Voorde

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.

Combinatorics · Mathematics 2012-11-13 Koichi Betsumiya , Masaaki Harada , Akihiro Munemasa

MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…

Information Theory · Computer Science 2022-10-04 Ruhao Wan , Yang Li , Shixin Zhu

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

Combinatorics · Mathematics 2014-11-25 Martino Borello , Gabriele Nebe

We prove that a putative $[72,36,16]$ code is not the image of linear code over $\ZZ_4$, $\FF_2 + u \FF_2$ or $\FF_2+v\FF_2$, thus proving that the extremal doubly even $[72,36,16]$-binary code cannot have an automorphism group containing a…

Combinatorics · Mathematics 2013-03-26 Steven T Dougherty , Suat Karadeniz , Bahattin Yildiz

In this note we investigate extremal singly-even self-dual codes with minimal shadow. For particular parameters we prove non-existence of such codes. By a result of Rains \cite{Rains-asymptotic}, the length of extremal singly-even self-dual…

Combinatorics · Mathematics 2012-10-10 Stefka Bouyuklieva , Wolfgang Willems

In this work, we propose a modified four circulant construction for self-dual codes and a bordered version of the construction using the properties of \lambda-circulant and \lambda-reverse circulant matrices. By using the constructions on…

Information Theory · Computer Science 2016-02-24 Abidin Kaya , Bahattin Yildiz , Abdullah Paşa

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

Information Theory · Computer Science 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan

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…

Combinatorics · Mathematics 2025-07-14 Alexander Barg , Alexey Glazyrin , Wei-Jiun Kao , Ching-Yi Lai , Pin-Chieh Tseng , Wei-Hsuan Yu

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…

Information Theory · Computer Science 2016-11-26 Abidin Kaya , Bahattin Yildiz

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Information Theory · Computer Science 2017-09-22 Alp Bassa , Henning Stichtenoth

A classification of quaternary Hermitian self-dual codes of length 20 is given. Using this classification, a classification of extremal quaternary Hermitian self-dual codes of length 22 is also given.

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Akihiro Munemasa

It is shown that an n-dimensional unimodular lattice has minimal norm at most 2[n/24] +2, unless n = 23 when the bound must be increased by 1. This result was previously known only for even unimodular lattices. Quebbemann had extended the…

Combinatorics · Mathematics 2007-05-23 E. M. Rains , N. J. A. Sloane
‹ Prev 1 3 4 5 6 7 10 Next ›