English
Related papers

Related papers: Repeated-Root Cyclic Codes with Optimal Parameters…

200 papers

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Information Theory · Computer Science 2020-01-07 Ziling Heng , Cunsheng Ding , Weiqiong Wang

This paper is dealing with DNA cyclic codes which play an important role in DNA computing and have attracted a particular attention in the literature. Firstly, we introduce a new family of DNA cyclic codes over the ring…

Information Theory · Computer Science 2015-05-26 Nabil Bennenni , Kenza Guenda , Sihem Mesnager

Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langle\xi\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langle\xi^{3lp^{s}}\rangle$, where $\xi$ is…

Information Theory · Computer Science 2016-01-25 Li Liu , Lanqiang Li , Xiaoshan Kai , Shixin Zhu

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…

Information Theory · Computer Science 2021-08-24 Zhao Hu , Nian Li , Xiangyong Zeng , Lisha Wang , Xiaohu Tang

Subspace codes have recently been used for error correction in random network coding. In this work, we focus on one-orbit cyclic subspace codes. If $S$ is an $\mathbb{F}_q$-subspace of $\mathbb{F}_{q^n}$, then the one-orbit cyclic subspace…

Information Theory · Computer Science 2024-05-06 Chiara Castello , Olga Polverino , Ferdinando Zullo

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…

For index coding problems with special structure on the side-information graphs called Interlinked Cycle (IC) structures index codes have been proposed in the literature (C. Thapa, L. Ong, and S. Johnson, "Interlinked Cycles for Index…

Information Theory · Computer Science 2018-04-25 Shanuja Sasi , B. Sundar Rajan

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as…

Information Theory · Computer Science 2014-06-20 Joachim Rosenthal , Anna-Lena Trautmann

The puncturing and shortening technique are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on the puncturing technique has been made, and many works on punctured linear codes…

Information Theory · Computer Science 2020-07-14 Yang Liu , Cunsheng Ding , Chunming Tang

The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes…

Information Theory · Computer Science 2017-05-30 Arti Yardi , Ruud Pellikaan

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…

Information Theory · Computer Science 2020-03-26 Martino Borello , Abdelillah Jamous

In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the…

Information Theory · Computer Science 2017-04-10 Nicola Durante , Alessandro Siciliano

In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta…

Information Theory · Computer Science 2017-12-22 Reza Dastbasteh , Seyyed Hamed Mousavi , Taher Abualrub , Nuh Aydin , Javad Haghighat

Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of…

Information Theory · Computer Science 2024-02-07 Allison Beemer , Ryan Coatney , Venkatesan Guruswami , Hiram H. López , Fernando Piñero

In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Barbara Langfeld

Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…

Information Theory · Computer Science 2023-05-24 Yun Li , Hongwei Liu , Sihem Mesnager

An important family of codes for data storage systems, cryptography, consumer electronics, and network coding for error control in digital communications are the so-called cyclic codes. This kind of linear codes are also important due to…

Information Theory · Computer Science 2025-06-16 Gerardo Vega , Félix Hernández

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-06-12 Dong He , Peipei Zheng , Qunying Liao

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams