English
Related papers

Related papers: Three classes of propagation rules for generalized…

200 papers

The Galois hulls of linear codes are a generalization of the Euclidean and Hermitian hulls of linear codes. In this paper, we study the Galois hulls of (extended) GRS codes and present several new constructions of MDS codes with Galois…

Information Theory · Computer Science 2022-09-20 Yang Li , Shixin Zhu , Pi Li

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

Recently, the construction of new MDS Euclidean self-dual codes has been widely investigated. In this paper, for square q, we utilize generalized Reed-Solomon (GRS) codes and their extended codes to provide four generic families of q-ary…

Information Theory · Computer Science 2021-10-28 Ziteng Huang , Weijun Fang , Fang-Wei Fu

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

In recent years, the construction of non-GRS type linear codes has attracted considerable attention due to that they can effectively resist both the Sidelnikov-Shestakov attack and the Wieschebrink attack. Constructing linear complementary…

Information Theory · Computer Science 2026-03-18 Zhonghao Liang , Dongmei Huang , Qunying Liao , Cuiling Fan , Zhengchun Zhou

The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…

Information Theory · Computer Science 2018-07-13 Gaojun Luo , Xiwang Cao

An important family of quantum codes is the quantum maximum-distance-separable (MDS) codes. In this paper, we construct some new classes of quantum MDS codes by generalized Reed-Solomon (GRS) codes and Hermitian construction. In addition,…

Information Theory · Computer Science 2023-10-03 Ruhao Wan

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

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 that are not equivalent to generalized Reed-Solomon (GRS) codes are called non-GRS MDS codes. Alongside near MDS (NMDS) codes, they are applicable in communication, cryptography, and storage systems.…

Information Theory · Computer Science 2025-08-05 Yang Li , Martianus Frederic Ezerman , Huimin Lao , San Ling

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

Let $\mathbb{F}_q$ be a finite field with $q=p^{e}$ elements, where $p$ is a prime number and $e \geq 1$ is an integer. In this paper, by means of generalized Reed-Solomon (GRS) codes, we construct two new classes of quantum…

Information Theory · Computer Science 2020-02-17 Hualu Liu , Xiusheng Liu

In this paper, we provide conditions that hulls of generalized Reed-Solomon (GRS) codes are also GRS codes from algebraic geometry codes. If the conditions are not satisfied, we provide a method of linear algebra to find the bases of hulls…

Information Theory · Computer Science 2024-01-25 Xue Jia , Qin Yue , Huan Sun , Junzhen Sui

In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the direct sum construction and the $(\mathbf{u},\mathbf{u+v})$-construction. Some new criteria for the…

Information Theory · Computer Science 2022-12-20 Yang Li , Shixin Zhu , Edgar Martínez-Moro

Let $q=p^m$ be a prime power, $e$ be an integer with $0\leq e\leq m-1$ and $s=\gcd(e,m)$. In this paper, for a vector $v$ and a $q$-ary linear code $C$, we give some necessary and sufficient conditions for the equivalent code $vC$ of $C$…

Information Theory · Computer Science 2024-12-09 Ruhao Wan , Shixin Zhu

In their seminal 1989 work (IEEE Trans. Inf. Theory 35(3):655-657), Roth and Lempel constructed a well-known family of non-Reed-Solomon maximum distance separable (MDS) codes. For decades, this family of codes has attracted extensive…

Information Theory · Computer Science 2026-04-28 Qi Liu , Xuefei Wu , Yingchun Cheng , Haiyan Zhou

Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…

Information Theory · Computer Science 2025-09-29 Yunlong Zhu , Chang-An Zhao

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

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