English
Related papers

Related papers: Construction of extremal Type II $\mathbb{Z}_{8}$-…

200 papers

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal…

Information Theory · Computer Science 2013-12-10 Vladimir D. Tonchev

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

For some extremal (optimal) odd unimodular lattices L in dimensions n=12,16,20,32,36,40 and 44, we determine all positive integers k such that L contains a k-frame. This result yields the existence of an extremal Type I Zk-code of lengths…

Combinatorics · Mathematics 2013-01-23 Masaaki Harada , Tsuyoshi Miezaki

Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of…

Information Theory · Computer Science 2015-08-11 Liqing Xu , Hao Chen

In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…

Information Theory · Computer Science 2019-10-01 Xiaolei Fang , Meiqing Liu , Jinquan Luo

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

Let $\mathscr{R}_{e,m}$ denote a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 3,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

Information Theory · Computer Science 2026-01-16 Monika Yadav , Anuradha Sharma

An efficient algorithm for classification of binary self-dual codes is presented. As an application, a complete classification of the self-dual codes of length 38 is given.

Combinatorics · Mathematics 2012-10-10 Stefka Bouyuklieva , Iliya Bouyukliev

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

The main focus of this paper is the complete enumeration of self-dual abelian codes in non-principal ideal group algebras $\mathbb{F}_{2^k}[A\times \mathbb{Z}_2\times \mathbb{Z}_{2^s}]$ with respect to both the Euclidean and Hermitian inner…

Rings and Algebras · Mathematics 2016-09-27 Parinyawat Choosuwan , Somphong Jitman , Patanee Udomkavanich

A relationship between $s$-extremal singly even self-dual $[24k+8,12k+4,4k+2]$ codes and extremal doubly even self-dual $[24k+8,12k+4,4k+4]$ codes with covering radius meeting the Delsarte bound, is established. As an example of the…

Combinatorics · Mathematics 2017-10-20 Masaaki Harada , Akihiro Munemasa

Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero…

Information Theory · Computer Science 2025-07-30 François Arnault , Philippe Gaborit , Nicolas Saussay

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…

Group Theory · Mathematics 2017-12-19 E. A. O'Brien , Petr Vojtěchovský

Let $\mathcal{R}_{e,m}$ be a finite commutative chain ring of even characteristic with maximal ideal $\langle u \rangle$ of nilpotency index $e \geq 2,$ Teichm$\ddot{u}$ller set $\mathcal{T}_{m},$ and residue field…

Information Theory · Computer Science 2026-01-16 Monika Yadav , Anuradha Sharma

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

We consider the class of linear antipodal two-weight rank metric codes and discuss their properties and characterization in terms of $t$-spreads. It is shown that the dimension of such codes is $2$ and the minimum rank distance is at least…

Information Theory · Computer Science 2022-08-18 Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…

Quantum Physics · Physics 2014-10-10 A. Naghipour , M. A. Jafarizadeh , S. Shahmorad

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 continue the study of classical and quantum low-density parity check (LDPC) codes from a physical perspective. We focus on constructive approaches and formulate a general framework for systematically constructing codes with various…

Quantum Physics · Physics 2024-02-27 Tibor Rakovszky , Vedika Khemani

We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.

Information Theory · Computer Science 2020-12-14 Sascha Kurz