English
Related papers

Related papers: On Euclidean, Hermitian and symplectic quasi-cycli…

200 papers

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

In this article, first we present a method for constructing many Hermitian LCD codes from a given Hermitian LCD code, and then provide several methods which utilize either a given [n, k, d] linear code or a given [n, k, d] Galois LCD code…

Information Theory · Computer Science 2023-10-09 Gyanendra K. Verma , Astha Agrawal , R. K. Sharma

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

Information Theory · Computer Science 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan

Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based…

Information Theory · Computer Science 2025-10-14 Qingfeng Xia , Hongwei Liu , Hao Chen , Xu Pan

Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…

Information Theory · Computer Science 2024-12-20 Guodong Wang , Shengwei Liu , Hongwei Liu

We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and…

Information Theory · Computer Science 2022-01-24 Ankan Shaw , Sanjit Bhowmick , Satya Bagchi

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

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é

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

The aim of this paper is to give conditions for the equivalency between skew constacyclic codes, skew cyclic codes and skew negacyclic codes defined over semi-local rings. Also, we provide construction and an enumeration of Euclidean and…

Information Theory · Computer Science 2019-02-25 Ranya D. Boulanouar , Aicha Batoul

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

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

This paper introduces a class of Hermitian LCD $2$-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes are asymptotically good…

Information Theory · Computer Science 2026-01-08 Sanjit Bhowmick , Kuntal Deka

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

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 recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink attack. Constructing linear complementary…

Information Theory · Computer Science 2026-03-18 Zhonghao Liang , Dongmei Huang , Qunying Liao , Cuiling Fan , Zhengchun Zhou

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

Information Theory · Computer Science 2019-03-27 Martino Borello , Cem Güneri , Elif Saçıkara , Patrick Solé

Linear complementary dual (LCD) codes is a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and…

Information Theory · Computer Science 2016-10-19 Sihem Mesnager , Chunming Tang , Yanfeng Qi

The hull of a linear code is the intersection of itself with its dual code with respect to certain inner product. Both Euclidean and Hermitian hulls are of theorical and practical significance. In this paper, we construct several new…

Information Theory · Computer Science 2022-10-06 Yang Li , Ruhao Wan , Shixin Zhu

The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…

Information Theory · Computer Science 2022-11-29 Hao Chen

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