English
Related papers

Related papers: Self-dual twisted generalized Reed-Solomon codes

200 papers

In this paper, by calculating the dual code of the Schur square for the standard twisted Reed-Solomon code, we give a sufficient and necessary condition for the generalized twisted Reed-Solomon code with $h+t\le k-1$ to be self-orthogonal,…

Information Theory · Computer Science 2022-01-11 Canze Zhu , Qunying Liao

In this paper, we study a class of twisted generalized Reed-Solomon (TGRS) codes with general l twists. A sufficient and necessary condition for the TGRS codes to be MDS or l-MDS (l<k and l<n-k) is determined. A sufficient and necessary…

Information Theory · Computer Science 2022-11-14 Haojie Gu , Jun Zhang

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

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

The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the…

Information Theory · Computer Science 2020-09-17 Yansheng Wu

In this paper, two classes of twisted generalized Reed-Solomon (TGRS) codes with multi-twists are studied. Firstly, some sufficient and necessary conditions for these codes to be self-orthogonal and self-dual are established. Then several…

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

Twisted generalized Reed-Solomon (TGRS) codes are an extension of the generalized Reed-Solomon (GRS) codes by adding specific twists, which attract much attention recently. This paper presents an in-depth and comprehensive investigation of…

Information Theory · Computer Science 2025-02-10 Zhao Hu , Liang Wang , Nian Li , Xiangyong Zeng , Xiaohu Tang

In this paper, we find a necessary and sufficient condition for multi-twisted Reed-Solomon codes to be MDS. In particular, we introduce a new class of MDS double-twisted Reed-Solomon codes $\mathcal{C}_{\bm \alpha, \bm t, \bm h, \bm \eta}$…

Information Theory · Computer Science 2023-12-15 Harshdeep Singh , Kapish Chand Meena

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

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and sufficient condition for these codes to be…

Information Theory · Computer Science 2026-04-29 Sanjit Bhowmick , Kuntal Deka , Edgar Martínez-Moro

In this article, we present a new construction of evaluation codes in the Hamming metric, which we call twisted Reed-Solomon codes. Whereas Reed-Solomon (RS) codes are MDS codes, this need not be the case for twisted RS codes. Nonetheless,…

Information Theory · Computer Science 2022-01-25 Peter Beelen , Sven Puchinger , Johan Rosenkilde

In this paper, we give a parity check matrix for the $(+)$-extended twisted generalized Reed Solomon (in short, ETGRS) code, and then not only prove that it is MDS or NMDS, but also determine the weight distribution. Especially, based on…

Information Theory · Computer Science 2022-11-10 Canze Zhu , Qunying Liao

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

We construct two new families of linear codes by modifying the generator matrices of generalized Reed-Solomon (GRS) codes. For these codes, we explicitly derive parity-check matrices and establish necessary and sufficient conditions…

Information Theory · Computer Science 2026-04-07 Kanat Abdukhalikov , Gyanendra K. Verma

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

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

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…

Information Theory · Computer Science 2025-06-16 Kanat Abdukhalikov , Cunsheng Ding , Gyanendra K. Verma

In this paper, we not only give the parity check matrix of the $[1,0]$-twisted generalized Reed-Solomon (in short, TGRS) code, but also determine the weight distribution. Especially, we show that the $[1,0]$-TGRS code is not GRS or EGRS.…

Information Theory · Computer Science 2023-04-25 Canze Zhu , Qunying Liao

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

In this work, doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the…

Information Theory · Computer Science 2022-12-13 Umberto Martínez-Peñas
‹ Prev 1 2 3 10 Next ›