English
Related papers

Related papers: A framework for constructing non-GRS MDS-NMDS code…

200 papers

For any admissible value of the parameters there exist Maximum Rank distance (shortly MRD) $\mathbb{F}_{q^n}$-linear codes of $\mathbb{F}_q^{n\times n}$. It has been shown in \cite{H-TNRR} (see also \cite{ByrneRavagnani}) that, if field…

Information Theory · Computer Science 2019-04-08 Luca Giuzzi , Ferdinando Zullo

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

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

Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there are only few $q$-ary quantum MDS $[[n,n-2d+2,d]]_q$ codes with minimum distances…

Information Theory · Computer Science 2015-10-08 Xianmang He , Liqing Xu , Hao Chen

Symbol-pair codes introduced by Cassuto and Blaum in 2010 are designed to protect against the pair errors in symbol-pair read channels. One of the central themes in symbol-error correction is the construction of maximal distance separable…

Information Theory · Computer Science 2022-06-02 Xiuxin Tang , Rong Luo

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

By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…

Information Theory · Computer Science 2024-05-03 Nicola Durante , Giovanni Giuseppe Grimaldi , Giovanni Longobardi

MDS codes play a central role in practice due to their broad applications. To date, most known MDS codes are generalized Reed-Solomon (GRS) codes, leaving codes that are not equivalent to GRS codes comparatively less understood. Studying…

Information Theory · Computer Science 2026-05-26 Runtian Zhu , Lingfei Jin

Recently, Roth and Skachek proposed two methods for constructing nearly maximum-distance separable (MDS) expander codes. We show that through the simple modification of using mixed-alphabet codes derived from MDS codes as constituent codes…

Information Theory · Computer Science 2007-08-09 Marc A. Armand , Jianwen Zhang

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

Entanglement-assisted quantum error correcting codes (EAQECCs) play a significant role in protecting quantum information from decoherence and quantum noise. Recently, constructing entanglement-assisted quantum maximum distance separable…

Information Theory · Computer Science 2020-09-17 Wan Jiang , Shixin Zhu , Xiaojing Chen

In this paper, we study a class of subcodes of codimension $1$ in the $[n,k+1]_q$ generalized Reed-Solomon (GRS) codes, whose generator matrix is derived by removing the row of degree $k-r$ from the generator matrix of the $[n,k+1]_q$ GRS…

Information Theory · Computer Science 2025-07-08 Yu Ning

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

Motivated by the application of high-density data storage technologies, symbol-pair codes are proposed to protect against pair-errors in symbol-pair channels, whose outputs are overlapping pairs of symbols. The research of symbol-pair codes…

Information Theory · Computer Science 2016-06-14 Baokun Ding , Gennian Ge , Jun Zhang , Tao Zhang , Yiwei Zhang

Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong \cite{WH} found a new class of deep holes for standard Reed-Solomon codes. In the present paper, we give a concise method to obtain a…

Information Theory · Computer Science 2012-05-31 Jun Zhang , Fang-Wei Fu , Qun-Ying Liao

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 Profile (MDP) convolutional codes are an important class of channel codes due to their maximal delay-constrained error correction capabilities. The design of MDP codes has attracted significant attention from the research…

Information Theory · Computer Science 2025-07-15 Sakshi Dang , Julia Lieb , Okko Makkonen , Pedro Soto , Alex Sprintson

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

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

The main conjecture on maximum distance separable (MDS) codes states that, execpt for some special cases, the maximum length of a q-ary linear MDS code is q+1. This conjecture does not hold true for near maximum distance separable codes…

Algebraic Geometry · Mathematics 2007-07-16 Massimo Giulietti
‹ Prev 1 4 5 6 7 8 10 Next ›