English
Related papers

Related papers: New Constructions of MDS Symbol-Pair Codes

200 papers

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 linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said…

Information Theory · Computer Science 2023-07-11 Zhonghua Sun , Cunsheng Ding

Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using…

Information Theory · Computer Science 2024-06-17 Shanqi Pang , Chaomeng Zhang , Mengqian Chen , Miaomiao Zhang

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are…

Information Theory · Computer Science 2019-06-24 Hanxu Hou , Yunghsiang Han , Patrick P. C. Lee , Yuchong Hu , Hui Li

It has been a great challenge to construct new quantum MDS codes. In particular, it is very hard to construct quantum MDS codes with relatively large minimum distance. So far, except for some sparse lengths, all known $q$-ary quantum MDS…

Information Theory · Computer Science 2020-07-14 Lingfei Jin , Chaoping Xing

A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\mathcal{A}^n$, such that the Hamming distance between two…

Combinatorics · Mathematics 2015-04-28 Janne I. Kokkala , Patric R. J. Östergård

Maximum distance separable (MDS) codes are widely used in distributed storage systems as they provide optimal fault tolerance for a given amount of storage overhead. The seminal work of Dimakis~\emph{et al.} first established a lower bound…

Information Theory · Computer Science 2026-03-24 Zihao Zhang , Guodong Li , Sihuang Hu

Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of…

Information Theory · Computer Science 2020-08-11 Hongwei Liu , Shengwei Liu

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. To get $q$-ary quantum MDS codes, it suffices to find linear MDS codes $C$ over $\mathbb{F}_{q^2}$ satisfying $C^{\perp_H}\subseteq C$ by the Hermitian…

Information Theory · Computer Science 2014-03-12 Bocong Chen , San Ling , Guanghui Zhang

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

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

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

We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…

Information Theory · Computer Science 2014-01-17 Son Hoang Dau , Wentu Song , Chau Yuen

Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we…

Information Theory · Computer Science 2015-11-24 Chin Hei Chan , Maosheng Xiong

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu

A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…

Information Theory · Computer Science 2022-04-26 Xiaoru Li , Ziling Heng

Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…

Information Theory · Computer Science 2025-01-28 Yang Li , Zhonghua Sun , Shixin Zhu

A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions…

Information Theory · Computer Science 2013-05-02 Mario Blaum

Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…

Information Theory · Computer Science 2019-09-17 Mehmet E. Koroglu , Mustafa Sarı

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

Information Theory · Computer Science 2022-07-14 Ted Hurley