English
Related papers

Related papers: A class of constacyclic codes are generalized Reed…

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

Maximum distance separable (MDS) codes are considered optimal because the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are likely the generalized Reed-Solomon (GRS) codes. In 1989, Roth…

Information Theory · Computer Science 2025-07-29 Shengwei Liu , Hongwei Liu , Bocong Chen

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

In this paper we investigate the class of constacyclic codes, which is a natural generalization of the class of cyclic and negacyclic codes. This class of codes is interesting in the sense that it contains codes with good or even optimal…

Information Theory · Computer Science 2016-02-12 Giuliano G. La Guardia

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

This paper contributes to maximum distance separable (MDS) and near MDS (NMDS) properties of the extended generalized twisted Reed-Solomon (TGRS) codes. Firstly, a family of extended TGRS (ETGRS) are constructed by appending three columns…

Information Theory · Computer Science 2026-05-25 Yanli Wang , Yanxin Chen , Tongjiang Yan

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

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

Self-dual maximum distance separable codes (self-dual MDS codes) and self-dual near MDS codes are very important in coding theory and practice. Thus, it is interesting to construct self-dual MDS or self-dual near MDS codes. In this paper,…

Information Theory · Computer Science 2020-09-15 Daitao Huang , Qin Yue , Yongfeng Niu , Xia Li

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

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

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) 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

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

Generalized Reed-Solomon and extended generalized Reed-Solomon (abbreviation to GRS and EGRS) codes are the most well-known family of MDS codes with wide applications in coding theory and practice. Let $\mathbb{F}_q$ be the $q$ elements…

Information Theory · Computer Science 2022-04-27 Canze Zhu

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible…

Information Theory · Computer Science 2016-08-10 Shuxing Li , Gennian Ge

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…

Information Theory · Computer Science 2014-05-22 Liqi Wang , Shixin Zhu

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

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…

Information Theory · Computer Science 2023-07-11 Ruhao Wan , Shixin Zhu

Symbol-pair codes are block codes with symbol-pair metrics designed to protect against pair-errors that may occur in high-density data storage systems. MDS symbol-pair codes are optimal in the sense that it can attain the highest pair-error…

Information Theory · Computer Science 2021-11-29 Xilin Tang , Weixian Li , Wei Zhao
‹ Prev 1 2 3 10 Next ›