English
Related papers

Related papers: Algebraic structures of MRD Codes

200 papers

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…

Information Theory · Computer Science 2020-03-26 Martino Borello , Abdelillah Jamous

In this paper, we present three new classes of $q$-ary quantum MDS codes utilizing generalized Reed-Solomon codes satisfying Hermitian self-orthogonal property. Among our constructions, the minimum distance of some $q$-ary quantum MDS codes…

Information Theory · Computer Science 2019-09-18 Xiaolei Fang , Jinquan Luo

In this short survey we concern ourselves with minimal codes, a classical object in coding theory. We will explain the relation between minimal codes and various other mathematical domains, in particular with finite projective geometry.…

History and Overview · Mathematics 2024-11-20 Martin Scotti

Let $\mathcal{C}$ be a set of $m$ by $n$ matrices over $\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in \mathcal{C}$. Suppose that $m\leqslant n$. If $\#\mathcal{C}= q^{n(m-d+1)}$, then $\mathcal{C}$ is a…

Combinatorics · Mathematics 2018-05-29 Guglielmo Lunardon , Rocco Trombetti , Yue Zhou

The tensor rank of some Gabidulin codes of small dimension is investigated. In particular, we determine the tensor rank of any rank metric code equivalent to an $8$-dimensional $\mathbb{F}_q$-linear generalized Gabidulin code in…

Information Theory · Computer Science 2022-01-21 Daniele Bartoli , Giovanni Zini , Ferdinando Zullo

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

Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…

Information Theory · Computer Science 2021-10-27 Ted Hurley , Donny Hurley , Barry Hurley

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the…

Combinatorics · Mathematics 2016-06-08 John Sheekey

Twisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study three classes of twisted Gabidulin codes with different twists. Moreover, we establish necessary and sufficient…

Information Theory · Computer Science 2025-09-17 Ran Li , Fang-Wei Fu , Weijun Fang

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…

Information Theory · Computer Science 2021-04-01 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…

Information Theory · Computer Science 2023-04-19 Andrea Ferraguti , Dorian Goldfeld , Giacomo Micheli

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

Combinatorics · Mathematics 2007-05-23 E. Martinez-Moro , I. F. Rua

A class of scattered linearized polynomials covering infinitely many field extensions is exhibited. More precisely, the $q$-polynomial over $\mathbb F_{q^6}$, $q \equiv 1\pmod 4$ described in arXiv:1906.05611, arXiv:1910.02278 is…

Combinatorics · Mathematics 2021-01-26 Giovanni Longobardi , Corrado Zanella

In this paper we consider a family $\mathcal{F}$ of $16$-dimensional $\mathbb{F}_q$-linear rank metric codes in $\mathbb{F}_q^{8\times8}$, arising from the polynomial $x^{q^s}+\delta x^{q^{4+s}}\in\mathbb{F}_{q^8}[x]$. Examples of MRD codes…

Combinatorics · Mathematics 2023-01-25 Marco Timpanella , Giovanni Zini

Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which…

Information Theory · Computer Science 2017-06-20 Michael Schelling , Martin Bossert

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

Number Theory · Mathematics 2017-03-08 Arturas Dubickas , Min Sha , Igor E. Shparlinski

In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…

Combinatorics · Mathematics 2008-04-21 Derrick Hart , Alex Iosevich , Doowon Koh , Steve Senger , Ignacio Uriarte-Tuero

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