English
Related papers

Related papers: Explicit MDS Codes with Complementary Duals

200 papers

Due to their widespread applications, linear complementary pairs (LCPs) have attracted much attention in recent years. In this paper, we determine explicit construction of non-special divisors of degree $g$ and $g-1$ on Kummer extensions…

Information Theory · Computer Science 2025-07-01 Huang Junjie , Chen Haojie , Zhang Huachao , Zhao Chang-An

A family of codes with a natural two-dimensional structure is presented, inspired by an application of RAID type of architectures whose units are solid state drives (SSDs). Arrays of SSDs behave differently to arrays of hard disk drives…

Information Theory · Computer Science 2014-09-12 Mario Blaum , James Lee Hafner , Steven Hetzler

Error-correcting pairs were introduced in 1988 by R. Pellikaan, and were found independently by R. K\"otter (1992), as a general algebraic method of decoding linear codes. These pairs exist for several classes of codes. However little or no…

Algebraic Geometry · Mathematics 2015-08-11 Irene Márquez-Corbella , Ruud Pellikaan

As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…

Information Theory · Computer Science 2015-07-21 Katherine Morrison

In this paper, we investigate the rank-metric codes which are proposed by Delsarte and Gabidulin to be complementary dual codes. We point out the relationship between Delsarte complementary dual codes and Gabidulin complementary dual codes.…

Information Theory · Computer Science 2017-08-04 Xiusheng Liu , Hualu Liu

For a given linear code $\C$ of length $n$ over $\gf(q)$ and a nonzero vector $\bu$ in $\gf(q)^n$, Sun, Ding and Chen defined an extended linear code $\overline{\C}(\bu)$ of $\C$, which is a generalisation of the classical extended code…

Information Theory · Computer Science 2023-12-12 Yansheng Wu , Cunsheng Ding , Tingfang Chen

We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…

Rings and Algebras · Mathematics 2025-08-25 Altaf Alshuhail

Let $t \in \{2,8,10,12,14,16,18\}$ and $n=31s+t\geq 14$, $d_{a}(n,5)$ and $d_{l}(n,5)$ be distances of binary $[n,5]$ optimal linear codes and optimal linear complementary dual (LCD) codes, respectively. We show that an $[n,5,d_{a}(n,5)]$…

Information Theory · Computer Science 2024-09-26 Yang Liu , Ruihu Li , Qiang Fu , Hao Song

Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integrated circuits. In this situation, the security parameters…

Information Theory · Computer Science 2025-02-05 F. J. Lobillo , José Manuel Muñoz

Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed to protect against the pair errors in symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable…

Information Theory · Computer Science 2022-06-02 Xiuxin Tang , Rong Luo

A linear code is said to be self-orthogonal if it is contained in its dual. Self-orthogonal codes are of interest because of their important applications, such as for constructing linear complementary dual (LCD) codes and quantum codes. In…

Information Theory · Computer Science 2023-12-08 Dengcheng Xie , Shixin Zhu , Yang Li

Double Toeplitz (DT) codes are codes with a generator matrix of the form $(I,T)$ with $T$ a Toeplitz matrix, that is to say constant on the diagonals parallel to the main. When $T$ is tridiagonal and symmetric we determine its spectrum…

Information Theory · Computer Science 2021-03-09 Minjia Shi , Ferruh Özbudak , Li Xu , Patrick Solé

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

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…

Information Theory · Computer Science 2023-02-23 Gobinda Ghosh , Sudhan Majhi , Shubabrata Paul

This work explores LCD and self-dual codes over a noncommutative non-unital ring $ E_p= \langle r,s ~|~ pr =ps=0,~ r^2=r,~ s^2=s,~ rs=r,~ sr=s \rangle$ of order $p^2$ where $p$ is a prime. Initially, we study the monomial equivalence of two…

Information Theory · Computer Science 2025-01-23 Anup Kushwaha , Indibar Debnath , Om Prakash

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

New infinite families of quantum symmetric and asymmetric codes are constructed. Several of these are MDS. The codes obtained are shown to have parameters which are better than previously known. A number of known codes are special cases of…

Information Theory · Computer Science 2012-08-14 Kenza Guenda , T. Aaron Gulliver

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

Information Theory · Computer Science 2016-02-16 F. Shirani , M. Heidari , S. S. Pradhan

In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that…

Information Theory · Computer Science 2021-08-12 Steven T. Dougherty , Joe Gildea , Adrian Korban , Adam M. Roberts
‹ Prev 1 3 4 5 6 7 10 Next ›