English
Related papers

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

200 papers

Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…

Information Theory · Computer Science 2025-07-15 Chiara Castello , Paolo Santonastaso

In this paper we study $\prod\limits_{i=1}^{n} \mathbb{Z}_{2^i}$-Additive Cyclic Codes. These codes are identified as $\mathbb{Z}_{2^n}[x]$-submodules of $\prod\limits_{i=1}^{n}\mathbb{Z}_{2^i}[x]/ \langle x^{\alpha_i}-1\rangle$; $\alpha_i$…

Information Theory · Computer Science 2017-08-24 Tapabrata Roy , Santanu Sarkar

A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…

Combinatorics · Mathematics 2023-07-19 Makoto Araya , Masaaki Harada , Vladimir D. Tonchev

In 2013, Nebe and Villar gave a series of ternary self-dual codes of length $2(p+1)$ for a prime $p$ congruent to $5$ modulo $8$. As a consequence, the third ternary extremal self-dual code of length $60$ was found. We show that the ternary…

Combinatorics · Mathematics 2023-03-28 Makoto Araya , Masaaki Harada , Koji Momihara

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

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

Let $\mathbb{F}_{2^m}$ be a finite field of characteristic $2$ and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m} +u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For…

Information Theory · Computer Science 2015-11-18 Yonglin Cao , Yuan Cao , Fang-Wei Fu

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.

Information Theory · Computer Science 2010-04-08 Kenza Guenda

Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…

Information Theory · Computer Science 2012-02-07 Sunghyu Han , Jon-Lark Kim

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

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…

Information Theory · Computer Science 2023-01-09 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yu Yao

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

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that g^p is a fixed point free involution. If C is extremal of length a multiple of 24 all the involutions are fixed point free, except the…

Information Theory · Computer Science 2013-01-29 Martino Borello , Wolfgang Willems

Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…

Information Theory · Computer Science 2022-06-28 Jon-Lark Kim , Whan-Hyuk Choi

Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…

Information Theory · Computer Science 2018-06-11 Minjia Shi , Hongwei Zhu , Liqin Qian , Lin Sok , Patrick Solé

Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p \times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…

Information Theory · Computer Science 2012-04-03 Yuan Li , Haibin Kan

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