English
Related papers

Related papers: On twisted generalized Reed-Solomon codes with l t…

200 papers

We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…

Quantum Physics · Physics 2024-08-13 Eric Kubischta , Ian Teixeira

For any admissible value of the parameters $n$ and $k$ there exist $[n,k]$-Maximum Rank distance ${\mathbb F}_q$-linear codes. Indeed, it can be shown that if field extensions large enough are considered, almost all rank distance codes are…

Combinatorics · Mathematics 2019-04-16 Luca Giuzzi , Ferdinando Zullo

Codes in the sum-rank metric have various applications in error control for multishot network coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) codes contain Reed-Solomon and Gabidulin codes as…

Information Theory · Computer Science 2022-09-05 Felicitas Hörmann , Hannes Bartz , Sven Puchinger

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

Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct…

Information Theory · Computer Science 2024-05-28 Mike Hamburg , Eric Linstadt , Danny Moore , Thomas Vogelsang

We consider the weight distributions of the cosets of weight 2 of the generalized $[q+1,q+2-d,d]_q$ doubly extended Reed-Solomon codes (GDRS) of minimum distance $d\ge5$, over the finite field $\mathbb{F}_q$ with $q$ elements. For a GDRS…

Information Theory · Computer Science 2026-05-12 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of…

Information Theory · Computer Science 2021-10-26 Xavier Caruso , Amaury Durand

Both horizontal interleaving as well as the sum-rank metric are currently attractive topics in the field of code-based cryptography, as they could mitigate the problem of large key sizes. In contrast to vertical interleaving, where…

Information Theory · Computer Science 2023-08-23 Felicitas Hörmann , Hannes Bartz

Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multishot network coding, distributed storage and quantum-resistant cryptography. The sum-rank analogs of Reed-Solomon and Gabidulin codes are…

Information Theory · Computer Science 2022-09-07 Felicitas Hörmann , Hannes Bartz

In this paper, we prove that the sub-field images of generalized Reed-Solomon (RS) codes can achieve the symmetric capacity of p-ary memoryless channels. Unlike the totally random linear code ensemble, as a class of maximum distance…

Information Theory · Computer Science 2025-05-14 Xiangping Zheng , Xiao Ma

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…

Information Theory · Computer Science 2019-12-06 Weijun Fang , Fang-Wei Fu

This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any…

Information Theory · Computer Science 2018-01-19 Alessandro Neri , Anna-Lena Horlemann-Trautmann

This article defines multi-twisted Goppa (MTG) codes as subfield subcodes of duals of multi-twisted Reed-Solomon (MTRS) codes and examines their properties. We show that if $t$ is the degree of the MTG polynomial defining an MTG code, its…

Information Theory · Computer Science 2026-02-19 Harshdeep Singh , Anuj Kumar Bhagat , Ritumoni Sarma , Indivar Gupta

We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…

Algebraic Geometry · Mathematics 2008-01-28 David Joyner , Amy Ksir , Will Traves

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing…

Quantum Physics · Physics 2025-10-09 Zijian Liang , Ke Liu , Hao Song , Yu-An Chen

MDS self-dual codes have nice algebraic structures and are uniquely determined by lengths. Recently, the construction of MDS self-dual codes of new lengths has become an important and hot issue in coding theory. In this paper, we develop…

Information Theory · Computer Science 2022-10-04 Ruhao Wan , Yang Li , Shixin Zhu

In this paper we investigate left ideals as codes in twisted skew group rings. The considered rings, which are often algebras over a finite field, allows us to detect many of the well-known codes. The presentation, given here, unifies the…

Information Theory · Computer Science 2022-12-27 Angelot Behajaina , Martino Borello , Javier de la Cruz , Wolfgang Willems

In this paper, we study the third weight of generalized Reed-Muller codes. We prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of…

Information Theory · Computer Science 2014-01-22 Elodie Leducq