English
Related papers

Related papers: The lengths of Hermitian Self-Dual Extended Duadic…

200 papers

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

Information Theory · Computer Science 2022-01-05 Swati Bhardwaj , Madhu Raka

Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counting formulae are derived for DN codes. The special class of…

Information Theory · Computer Science 2016-06-03 Adel Alahmadi , Hatoon Shohaib , Patrick Solé

In this paper, we study cyclic codes over the Galois ring ${\rm GR}({p^2},s)$. The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length $p^a$ over ${\rm GR}({p^2},s)$. Combining with some known…

Rings and Algebras · Mathematics 2014-01-28 Somphong Jitman , San Ling , Ekkasit Sangwisut

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva

For any q which is a power of 2 we describe a finite subgroup of the group of invertible complex q by q matrices under which the complete weight enumerators of generalized doubly-even self-dual codes over the field with q elements are…

Number Theory · Mathematics 2014-09-17 Gabriele Nebe , H. -G. Quebbemann , E. M. Rains , N. J. A. Sloane

The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…

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

A linear code $C$ over $\mathbb{F}_q$ is called $\Delta$-divisible if the Hamming weights $\operatorname{wt}(c)$ of all codewords $c \in C$ are divisible by $\Delta$. The possible effective lengths of $q^r$-divisible codes have been…

Combinatorics · Mathematics 2025-02-19 Sascha Kurz

We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…

Information Theory · Computer Science 2007-11-14 Kenza Guenda

We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…

Number Theory · Mathematics 2017-06-26 Pınar Çomak , Jon-Lark Kim , Ferruh Özbudak

We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…

Information Theory · Computer Science 2014-08-19 Yixuan Xie , Jinhong Yuan , Yuichiro Fujiwara

In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have…

Information Theory · Computer Science 2019-09-04 Xiaolei Fang , Khawla Lebed , Hongwei Liu , Jinquan Luo

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…

Information Theory · Computer Science 2017-03-17 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

Information Theory · Computer Science 2016-10-05 Yun Fan , Liang Zhang

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, 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$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

In this paper we extend the work of Lisonek and Singh on construction X for quantum error-correcting codes to finite fields of order $p^2^ where p is prime. The results obtained are applied to the dual of Hermitian repeated root cyclic…

Information Theory · Computer Science 2013-12-23 Akshay Degwekar , Kenza Guenda , T. Aaron Gulliver

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Information Theory · Computer Science 2010-02-15 Kenza Guenda

In this work, four circulant and quadratic double circulant (QDC) constructions are applied to the family of the rings R_k,m. Self-dual binary codes are obtained as the Gray images of self-dual QDC codes over R_k,m. Extremal binary…

Information Theory · Computer Science 2016-10-31 Abidin Kaya , Nesibe Tüfekçi

Extending recent work on the Euclidean hull, we derive closed-form ratio decompositions for the number of linear codes with prescribed Hermitian and symplectic hull dimension. The Hermitian ratio admits a uniform lower bound of at least…

Combinatorics · Mathematics 2026-05-29 Keita Ishizuka

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a prime number and $m$ is a positive integer. Self-dual constacyclic codes of length \( p^s \) over \( \frac{\mathbb{F}_{p^m}[u]}{\langle u^3 \rangle} \) exist only…

Information Theory · Computer Science 2025-01-10 Youssef Ahendouz , Ismail Akharraz