English
Related papers

Related papers: New Euclidean and Hermitian Self-Dual Cyclic Codes…

200 papers

Maximum Distance Separable (MDS) self-dual codes are of significant theoretical and practical importance. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Correspondingly there have been many research on constructions…

Information Theory · Computer Science 2026-02-09 Chun'e Zhao , Wenping Ma

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

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

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a…

Information Theory · Computer Science 2020-06-02 Weijun Fang , Shu-Tao Xia , Fang-Wei Fu

In this paper, we construct a new family of distance-optimal binary cyclic codes with the minimum distance $6$ and a new family of distance-optimal quaternary cyclic codes with the minimum distance $4$. We also construct several families of…

Information Theory · Computer Science 2024-02-15 Hao Chen , Yanan Wu

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the known constructions via finite fields make use of the…

Information Theory · Computer Science 2021-07-27 Lingfei Jin , Liming Ma , Chaoping Xing

The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…

Combinatorics · Mathematics 2018-07-27 Daniel R. Hawtin , Cheryl E. Praeger

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

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

Systematic constructions of MDS self-dual codes is widely concerned. In this paper, we consider the constructions of MDS Euclidean self-dual codes from short length. Indeed, the exact constructions of MDS Euclidean self-dual codes from…

Information Theory · Computer Science 2019-10-24 Derong Xie , Xiaolei Fang , Jinquan Luo

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\ respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible over…

Information Theory · Computer Science 2009-06-23 Hakan Ozadam , Ferruh Ozbudak

In this paper new infinite families of linear binary completely transitive codes are presented. They have covering radius $\rho = 3$ and 4, and are a half part of the binary Hamming and the binary extended Hamming code of length $n=2^m-1$…

Combinatorics · Mathematics 2013-04-09 J. Borges , J. Rif`a , V. A. Zinoviev

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

Information Theory · Computer Science 2019-09-10 Parinyawat Choosuwan , Somphong Jitman

We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalize the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and A.…

Information Theory · Computer Science 2017-02-10 Itzhak Tamo , Alexander Barg , Sreechakra Goparaju , Robert Calderbank

In this paper, we study a family of constacyclic BCH codes over $\mathbb{F}_{q^2}$ of length $n=\frac{q^{2m}-1}{q+1}$, where $q$ is a prime power, and $m\geq2$ an even integer. The maximum design distance of narrow-sense Hermitian…

Information Theory · Computer Science 2020-07-28 X. Zhao , X. Li , Q. Wang , T. Yan

Double Toeplitz (shortly DT) codes are introduced here as a generalization of double circulant codes. We show that such a code is isodual, hence formally self-dual. Self-dual DT codes are characterized as double circulant or double…

Information Theory · Computer Science 2021-02-19 Minjia Shi , Li Xu , Patrick Solé

In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…

Rings and Algebras · Mathematics 2020-04-02 Joe Gildea , Abidin Kaya , Rhian Taylor , Alexander Tylyshchak , Bahattin Yildiz

We give the structure of $\lambda$-constacyclic codes of length $p^sm$ over $R=\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$ with $\lambda \in \F_{p^r}^*$. We also give the structure of $\lambda$-constacyclic codes of…

Information Theory · Computer Science 2012-12-03 Kenza Guenda , T. Aaron Gulliver