English
Related papers

Related papers: Linear complementary dual quasi-cyclic codes of in…

200 papers

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…

Information Theory · Computer Science 2018-05-25 Mokshi Goyal , Madhu Raka

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is 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-14 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

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

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

Information Theory · Computer Science 2025-10-21 Gyanendra K. Verma , R. K. Sharma

Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary dual (LCD) codes are useful in fault injections attacks on…

Information Theory · Computer Science 2020-11-09 Charul Rajput , Maheshanand Bhaintwal , Ramakrishna Bandi

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the…

Information Theory · Computer Science 2015-12-22 Alexander Zeh , San Ling

Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…

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

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…

Information Theory · Computer Science 2025-06-10 Chaofeng Guan , Ruihu Li , Jingjie Lv , Zhi Ma

In recent years, linear complementary pairs (LCP) of codes and linear complementary dual (LCD) codes have gained significant attention due to their applications in coding theory and cryptography. In this work, we construct explicit LCPs of…

Algebraic Geometry · Mathematics 2024-12-31 Alonso S. Castellanos , Adler V. Marques , Luciane Quoos

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…

Information Theory · Computer Science 2022-10-18 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yang Liu , Hao Song

Linear complementary dual (LCD) codes are linear codes that intersect with their dual trivially. We give a characterization of LCD codes over $\mathbb{F}_q$ having large minimum weights for $q \in \{2,3\}$. Using the characterization, we…

Combinatorics · Mathematics 2021-01-05 Makoto Araya , Masaaki Harada , Ken Saito

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

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

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

Information Theory · Computer Science 2020-12-10 Cem Güneri , San Ling , Buket Özkaya

A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…

Information Theory · Computer Science 2017-01-17 Lucky Galvez , Jon-Lark Kim , Nari Lee , Young Gun Roe , Byung-Sun Won

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro