English
Related papers

Related papers: Two new classes of quantum MDS codes from generali…

200 papers

Generalized Reed-Solomon codes form the most prominent class of maximum distance separable (MDS) codes, codes that are optimal in the sense that their minimum distance cannot be improved for a given length and code size. The study of codes…

Information Theory · Computer Science 2024-12-12 Shengwei Liu , Hongwei Liu , Frederique Oggier

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider…

Information Theory · Computer Science 2026-04-17 Amit Berman , Yaron Shany , Itzhak Tamo

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

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

Self-dual maximum distance separable (MDS) codes over finite fields are linear codes with significant combinatorial and cryptographic applications. Twisted generalized Reed-Solomon (TGRS) codes can be both MDS and self-dual. In this paper,…

Information Theory · Computer Science 2025-08-14 Chun'e Zhao , Yuxin Han , Wenping Ma , Tongjiang Yan , Yuhua Sun

The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of $q-$ary MDS self-dual codes for various lengths. There are not existence of $q-$ary MDS self-dual codes of…

Information Theory · Computer Science 2016-09-16 Hongxi Tong , Xiaoqing Wang

MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…

Information Theory · Computer Science 2025-04-03 Weirong Meng , Weijun Fang , Fang-Wei Fu , Haiyan Zhou , Ziyi Gu

In this paper, two new families of MDS quantum convolutional codes are constructed. The first one can be regarded as a generalization of \cite[Theorem 6.5]{GGGlinear}, in the sense that we do not assume that $q\equiv1\pmod{4}$. More…

Information Theory · Computer Science 2015-06-22 Guanghui Zhang , Bocong Chen , Liangchen Li

Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of $q$-ary MDS self-dual codes for…

Information Theory · Computer Science 2016-12-26 Lingfei Jin , Chaoping Xing

Maximum distance separable (in short, MDS), near MDS (in short, NMDS), and self-orthogonal codes play a pivotal role in algebraic coding theory, particularly in applications such as quantum communications and secret sharing scheme.…

Information Theory · Computer Science 2026-01-09 Zhonghao Liang , Chenlu Jia , Dongmei Huang , Qunying Liao , Chunming Tang

In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the dimensions of their Euclidean hulls or Hermitian hulls. It…

Information Theory · Computer Science 2019-12-09 Weijun Fang , Fang-Wei Fu , Lanqiang Li , Shixin Zhu

Self-dual MDS and NMDS codes over finite fields are linear codes with significant combinatorial and cryptographic applications. In this paper, firstly, we investigate the duality properties of generalized twisted Reed-Solomon (abbreviated…

Information Theory · Computer Science 2022-02-24 Guanmin Guo , Ruihu Li , Yang Liu , Hao Song

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider…

Information Theory · Computer Science 2020-05-26 Weijun Fang , Jun Zhang , Shu-Tao Xia1 , Fang-Wei Fu

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…

Information Theory · Computer Science 2026-04-08 Meiying Zhang , Shudi Yang , Yanbin Zheng

Based on the fundamental results on MDS self-dual codes over finite fields constructed via generalized Reed-Solomon codes \cite{JX} and extended generalized Reed-Solomon codes \cite{Yan}, many series of MDS self-dual codes with different…

Information Theory · Computer Science 2019-05-17 Aixian Zhang , Keqin Feng

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

In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…

Information Theory · Computer Science 2019-10-01 Xiaolei Fang , Meiqing Liu , Jinquan Luo

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight…

Quantum Physics · Physics 2020-07-01 Felix Huber , Markus Grassl

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