English
Related papers

Related papers: Many Non-Reed-Solomon Type MDS Codes From Arbitrar…

200 papers

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

It's well-known that maximum distance separable codes (in short, MDS) and linear complementary dual (in short, LCD) codes are very important in coding theory and practice. In 2023, Yue et al. [25] constructed three classes of LCD MDS codes…

Information Theory · Computer Science 2025-09-19 Zhonghao Liang , Qunying Liao

In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…

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

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

This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…

Information Theory · Computer Science 2019-02-25 Chuangqiang Hu , Shudi Yang

Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes of (extended) generalized Reed-Solomon (GRS) codes with Galois hulls of arbitrary dimensions. We also propose a…

Information Theory · Computer Science 2021-08-03 Xiaolei Fang , Renjie Jin , Jinquan Luo , Wen Ma

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

Cyclic maximum distance separable (MDS for short) codes are a special subclass of linear codes and have received a lot of attention, as these codes have very important applications in many areas including quantum codes, designs and finite…

Information Theory · Computer Science 2026-05-12 Can Xiang , Chunming 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

Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in $\proj^2$ are briefly…

Number Theory · Mathematics 2007-07-16 Chris Lomont

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

Information Theory · Computer Science 2020-06-02 José Gómez-Torrecillas , Gabriel Navarro , José Patricio Sánchez-Hernández

In this paper, we study Euclidean and Hermitian hulls of generalized Reed-Solomon codes and twisted generalized Reed-Solomon codes, as well as the Hermitian hulls of Roth-Lempel typed codes. We present explicit constructions of MDS and AMDS…

Information Theory · Computer Science 2022-07-19 Lin Sok

We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality. Furthermore, we study the Schur squares of the new…

Information Theory · Computer Science 2018-05-14 Peter Beelen , Martin Bossert , Sven Puchinger , Johan Rosenkilde

Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…

Information Theory · Computer Science 2024-04-09 Gaojun Luo , Lin Sok , Martianus Frederic Ezerman , San Ling

This article introduces Generalized Hyperderivative Reed-Solomon codes (GHRS codes), which generalize NRT Reed-Solomon codes. Its main results are as follows: 1) every GHRS code is MDS, 2) the dual of a GHRS code is also an GHRS code, 3)…

Information Theory · Computer Science 2025-12-30 Mahir Bilen Can , Benjamin Horowitz

By generalizing the stabilizer quantum error-correcting codes, entanglement-assisted quantum error-correcting (EAQEC) codes were introduced, which could be derived from any classical linear codes via the relaxation of self-orthogonality…

Information Theory · Computer Science 2024-03-19 Xiujing Zheng , Liqi Wang , Shixin Zhu

Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary…

Information Theory · Computer Science 2024-07-16 Hedongliang Liu , Hengjia Wei , Antonia Wachter-Zeh , Moshe Schwartz

This paper proposes a new class of multi-dimensional nonsystematic Reed-Solomon codes that are constructed based on the multi-dimensional Fourier transform over a finite field. The proposed codes are the extension of the nonsystematic…

Information Theory · Computer Science 2012-08-01 Akira Shiozaki

In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all $\mathbb F_{q^2}$-rational points of the curve is determined; the Feng-Rao designed minimum distance is…

Combinatorics · Mathematics 2017-07-18 Daniele Bartoli , Maria Montanucci , Giovanni Zini

Maximum distance separable (MDS) codes and near MDS (NMDS) codes are of particular interest in coding theory due to their optimal error-correcting capabilities and wide applications in communication, cryptography, and storage systems. A…

Information Theory · Computer Science 2026-05-13 Yang Li , Zhenliang Lu , San Ling , Kwok-Yan Lam
‹ Prev 1 3 4 5 6 7 10 Next ›