English
Related papers

Related papers: New Type I Binary [72, 36, 12] Self-Dual Codes fro…

200 papers

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

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

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Combinatorics · Mathematics 2015-03-11 Michael Kiermaier , Alfred Wassermann

Self-dual codes (Type I and Type II codes) play an important role in the construction of even unimodular lattices, and hence in the determination of Jacobi forms. In this paper, we construct both Type I and Type II codes (of higher lengths)…

Number Theory · Mathematics 2014-07-21 Anuradha Sharma , Amit K. Sharma

In this note, we study the existence of Hadamard matrices of order $36$ formed by codewords of weight $36$ in some ternary near-extremal self-dual codes of length $36$.

Combinatorics · Mathematics 2023-03-10 Masaaki Harada , Keita Ishizuka

Using the method for constructing binary self-dual codes with an automorphism of order square of a prime number we have classified all binary self-dual codes with length 76 having minimum distance $d=14$ and automorphism of order 9. Up to…

Combinatorics · Mathematics 2018-06-15 Nikolay Yankov , Radka Russeva , Emine Karatash

In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…

Information Theory · Computer Science 2024-12-23 Cong Yu , Shixin Zhu , Hao Chen , Yang Li , Xiuyu Zhang

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

Combinatorics · Mathematics 2015-03-13 Stefka Bouyuklieva , Nikolay Yankov , Radka Russeva

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one…

Information Theory · Computer Science 2017-04-06 Alexander Zhdanov

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

In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using $\lambda$-circulant matrices. The new constructions are derived as…

Combinatorics · Mathematics 2023-01-18 Adam Michael Roberts

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

In this paper, we study the linear codes over the commutative ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$ and their Gray images, where $v^{3}=v$. We define the Lee weight of the elements of $R$, we give a Gray map from $R^{n}$ to $\F^{3n}_{q}$ and…

Information Theory · Computer Science 2015-05-01 A. Melakheso , K. Guenda

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

Cryptography and Security · Computer Science 2020-03-31 Minjia Shi , Li Xu , Patrick Sole

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…

Combinatorics · Mathematics 2020-11-20 Masaaki Harada

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…

Information Theory · Computer Science 2019-10-11 Yansheng Wu , Xiaomeng Zhu , Qin Yue

Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…

Information Theory · Computer Science 2023-12-22 Canze Zhu , Qunying Liao , Haibo Liu

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez