English
Related papers

Related papers: Additive quaternary codes related to exceptional l…

200 papers

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

Information Theory · Computer Science 2026-05-13 Sujata Bansal , Pramod Kumar Kewat

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weight $d(n,k)$ among all binary linear complementary dual $[n,k]$ codes. We…

Combinatorics · Mathematics 2020-11-20 Makoto Araya , Masaaki Harada

Additive conjucyclic codes over $\F_{q^2}$ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general…

Information Theory · Computer Science 2026-03-31 Jingjie Lv , Xian Lian , Ruihu Li , Hanxu Hou

We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…

Information Theory · Computer Science 2020-04-28 Martianus Frederic Ezerman , San Ling , Buket Özkaya , Patrick Solé

The largest minimum weights among quaternary Hermitian linear complementary dual codes are known for dimension $2$. In this paper, we give some conditions for the nonexistence of quaternary Hermitian linear complementary dual codes with…

Combinatorics · Mathematics 2020-11-20 Makoto Araya , Masaaki Harada , Ken Saito

Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…

Information Theory · Computer Science 2012-10-23 Finley Freibert , Jon-Lark Kim

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

Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…

Information Theory · Computer Science 2026-01-21 Jingjun Bao , Hanlin Zou

Let $\mathcal{R}_e=GR(p^e,r)[y]/\langle g(y),p^{e-1}y^t\rangle$ be a finite commutative chain ring, where $p$ is a prime number, $GR(p^e,r)$ is the Galois ring of characteristic $p^e$ and rank $r,$ $t$ and $k$ are positive integers…

Information Theory · Computer Science 2024-12-16 Leijo Jose , Anuradha Sharma

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

In this paper we develop a technique to extend any bound for cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes. We use this technique to improve the searching of new bounds for abelian codes.

Information Theory · Computer Science 2016-04-12 J. J. Bernal , M. Guerreiro , J. J. Simón

Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…

Information Theory · Computer Science 2017-04-10 Shudi Yang , Xiangli Kong , Chunming Tang

Hulls of linear codes have been of interest and extensively studied due to their rich algebraic structures and wide applications. In this paper, alternative characterizations of hulls of linear codes are given as well as their applications.…

Information Theory · Computer Science 2019-09-11 Satanan Thipworawimon , Somphong Jitman

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…

Information Theory · Computer Science 2012-02-01 Adel Alahmadi , Patrick Solé , Houda Sboui , Olfa Yemen

Recently, binary cyclic codes with parameters $[n,(n\pm1)/2,\geq \sqrt{n}]$ have been a hot topic since their minimum distances have a square-root bound. In this paper, we construct four classes of binary cyclic codes…

Information Theory · Computer Science 2024-08-06 Xianhong Xie , Yaxin Zhao , Zhonghua Sun , Xiaobo Zhou

This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…

Information Theory · Computer Science 2022-08-09 Sebastian Heri , Julia Lieb , Joachim Rosenthal

Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…

Information Theory · Computer Science 2016-06-17 Cao Yuan , Li Qingguo

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be…

Information Theory · Computer Science 2022-08-31 Gaofei Wu , Huan Liu , Yuqing Zhang

LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…

Information Theory · Computer Science 2019-11-25 Carlos Galindo , Olav Geil , Fernando Hernando , Diego Ruano

We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the…

Combinatorics · Mathematics 2011-03-17 Lars Eirik Danielsen , Matthew G. Parker
‹ Prev 1 8 9 10 Next ›