English
Related papers

Related papers: Construction of Unit-Memory MDS Convolutional Code…

200 papers

Maximum Distance Separable (MDS) matrices play a central role in coding theory and symmetric-key cryptography due to their optimal diffusion properties. In this paper, we present a construction of MDS matrices using skew polynomial rings \(…

Information Theory · Computer Science 2026-02-03 Atif Ahmad Khan , Shakir Ali , Elif Segah Oztas , Abhishek Kesarwani

The singleton defect of an $[n,k,d]$ linear code ${\cal C}$ is defined as $s({\cal C})=n-k+1-d$. Codes with $S({\cal C})=0$ are called maximum distance separable (MDS) codes, and codes with $S(\cal C)=S(\cal C ^{\bot})=1$ are called near…

Information Theory · Computer Science 2022-08-19 Li Xu , Cuiling Fan , Dongchun Han

A Maximum Distance Separable code over an alphabet $F$ is defined via an encoding function $C:F^k \rightarrow F^n$ that allows to retrieve a message $m \in F^k$ from the codeword $C(m)$ even after erasing any $n-k$ of its symbols. The…

Information Theory · Computer Science 2020-05-15 Mira Gonen , Ishay Haviv , Michael Langberg , Alex Sprintson

In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over $\mathbb{F}_q$ with length $q+1$ and designed distance 3 to be 3 and 4 are provided. Let $d$ be the minimum distance of the BCH code…

Information Theory · Computer Science 2023-12-20 Haojie Xu , Xia Wu , Wei Lu , Xiwang Cao

In this paper, we present three new classes of $q$-ary quantum MDS codes utilizing generalized Reed-Solomon codes satisfying Hermitian self-orthogonal property. Among our constructions, the minimum distance of some $q$-ary quantum MDS codes…

Information Theory · Computer Science 2019-09-18 Xiaolei Fang , Jinquan Luo

Partial maximum distance separable (PMDS) codes are a kind of erasure codes where the nodes are divided into multiple groups with each forming an MDS code with a smaller code length, thus they allow repairing a failed node with only a few…

Information Theory · Computer Science 2022-11-15 Jie Li , Xiaohu Tang , Hanxu Hou , Yunghsiang S. Han , Bo Bai , Gong Zhang

Higher order MDS codes are an interesting generalization of MDS codes recently introduced by Brakensiek, Gopi and Makam (IEEE Trans. Inf. Theory 2022). In later works, they were shown to be intimately connected to optimally list-decodable…

Information Theory · Computer Science 2024-08-22 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction…

Maximum Distance Separable (MDS) codes with a sparse and balanced generator matrix are appealing in distributed storage systems for balancing and minimizing the computational load. Such codes have been constructed via Reed-Solomon codes…

Information Theory · Computer Science 2020-11-12 Tingting Chen , Xiande Zhang

Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space $\mathbb{F}_q^n$, where $q$ is a prime power and $\mathbb{F}_q$, the finite field of size $q$. In this paper we study the…

Information Theory · Computer Science 2020-11-06 Clementa Alonso-González , Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà

Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So…

Information Theory · Computer Science 2021-05-19 Yansheng Wu , Jong Yoon Hyun , Yoonjin Lee

Maximum distance separable (MDS) codes have significant combinatorial and cryptographic applications due to their certain optimality. Generalized Reed-Solomon (GRS) codes are the most prominent MDS codes. Twisted generalized Reed-Solomon…

Information Theory · Computer Science 2024-08-23 Chun'e Zhao , Wenping Ma , Tongjiang Yan , Yuhua Sun

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a…

Information Theory · Computer Science 2020-06-02 Weijun Fang , Shu-Tao Xia , Fang-Wei Fu

Convolutional codes with a maximum distance profile attain the largest possible column distances for the maximum number of time instants and thus have outstanding error-correcting capability especially for streaming applications. Explicit…

Information Theory · Computer Science 2024-01-09 Zitan Chen

In order to correct the pair-errors generated during the transmission of modern high-density data storage that the outputs of the channels consist of overlapping pairs of symbols, a new coding scheme named symbol-pair code is proposed. The…

Information Theory · Computer Science 2025-09-17 Xiujing Zheng , Liqi Wang , Shixin Zhu

A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…

Information Theory · Computer Science 2020-01-06 Hao Chen , Xianmang He , Jian Weng , Liqing Xu

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

In this paper, we construct a new family of distance-optimal binary cyclic codes with the minimum distance $6$ and a new family of distance-optimal quaternary cyclic codes with the minimum distance $4$. We also construct several families of…

Information Theory · Computer Science 2024-02-15 Hao Chen , Yanan Wu

Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required…

Information Theory · Computer Science 2013-02-19 Eyal En Gad , Robert Mateescu , Filip Blagojevic , Cyril Guyot , Zvonimir Bandic

In this paper, we propose two novel modulation concepts based on a simple maximum distance separable (MDS) code { and show that these concepts can achieve better error performance than index modulation (IM) and related schemes.} In the…

Signal Processing · Electrical Eng. & Systems 2021-08-11 Ferhat Yarkin , Justin P. Coon