A new family of linear maximum rank distance codes
From MaRDI portal
Publication:326326
DOI10.3934/amc.2016019zbMath1348.94087arXiv1504.01581OpenAlexW2963120842MaRDI QIDQ326326
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01581
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Semifields (12K10)
Related Items (94)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ \(r\)-fat linearized polynomials over finite fields ⋮ Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries ⋮ Self-duality of generalized twisted Gabidulin codes ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Extending two families of maximum rank distance codes ⋮ Linear sets on the projective line with complementary weights ⋮ Further results on LCD generalized Gabidulin codes ⋮ 50 years of translation structures ⋮ Exceptional scattered polynomials ⋮ Explicit constructions of some non-Gabidulin linear maximum rank distance codes ⋮ On self-dual MRD codes ⋮ Automorphism groups of Gabidulin-like codes ⋮ Scattered linear sets in a finite projective line and translation planes ⋮ On the number of inequivalent Gabidulin codes ⋮ On dually almost MRD codes ⋮ MDS and near-MDS codes via twisted Reed-Solomon codes ⋮ On \(q\)-Steiner systems from rank metric codes ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x\)] ⋮ On kernels and nuclei of rank metric codes ⋮ New criteria for MRD and Gabidulin codes and some rank-metric code constructions ⋮ Investigating the exceptionality of scattered polynomials ⋮ Maximum scattered \(\mathbb{F}_q\)-linear sets of \(\mathrm{PG}(1,q^4)\) ⋮ Automorphism groups and new constructions of maximum additive rank metric codes with restrictions ⋮ Covering Radius of Matrix Codes Endowed with the Rank Metric ⋮ On the number of roots of some linearized polynomials ⋮ Maximum scattered linear sets and MRD-codes ⋮ Nuclei and automorphism groups of generalized twisted Gabidulin codes ⋮ Identifiers for MRD-codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces ⋮ Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes ⋮ A characterization of the number of roots of linearized and projective polynomials in the field of coefficients ⋮ Rank-Metric Codes, Semifields, and the Average Critical Problem ⋮ Weight distribution of rank-metric codes ⋮ Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Codes with few weights arising from linear sets ⋮ New semifields and new MRD codes from skew polynomial rings ⋮ Division algebras and MRD codes from skew polynomials ⋮ On a family of linear MRD codes with parameters \([8\times 8,16,7_q\)] ⋮ Antipodal two-weight rank metric codes ⋮ On certain linearized polynomials with high degree and kernel of small dimension ⋮ On the genericity of maximum rank distance and Gabidulin codes ⋮ Duality of generalized twisted Reed-Solomon codes and Hermitian self-dual MDS or NMDS codes ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Some new non-additive maximum rank distance codes ⋮ The \((+)\)-extended twisted generalized Reed-Solomon code ⋮ Saturating systems and the rank-metric covering radius ⋮ Constructions and equivalence of Sidon spaces ⋮ On the automorphism groups of Lunardon-Polverino scattered linear sets ⋮ Exceptional scatteredness in prime degree ⋮ On the classification of exceptional scattered polynomials ⋮ Linearized trinomials with maximum kernel ⋮ A characterization of linearized polynomials with maximum kernel ⋮ Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects ⋮ Construction of MDS twisted Reed-Solomon codes and LCD MDS codes ⋮ On a conjecture about maximum scattered subspaces of \(\mathbb{F}_{q^6}\times\mathbb{F}_{q^6}\) ⋮ Partially scattered linearized polynomials and rank metric codes ⋮ Classes and equivalence of linear sets in \(\mathrm{PG}(1,q^{n})\) ⋮ A new family of MRD-codes ⋮ MRD-codes and linear sets ⋮ A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes ⋮ On the intersection problem for linear sets in the projective line ⋮ A condition for scattered linearized polynomials involving Dickson matrices ⋮ Generalized twisted Gabidulin codes ⋮ Linear sets and MRD-codes arising from a class of scattered linearized polynomials ⋮ On decoding additive generalized twisted Gabidulin codes ⋮ New maximum scattered linear sets of the projective line ⋮ Scattered subspaces and related codes ⋮ On maximum additive Hermitian rank-metric codes ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Rank-metric codes, linear sets, and their duality ⋮ Random construction of partial MDS codes ⋮ A Carlitz type result for linearized polynomials ⋮ On the sparseness of certain linear MRD codes ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ Puncturing maximum rank distance codes ⋮ A class of linear sets in \(\mathrm{PG} (1,q^5)\) ⋮ Rank-Metric Codes Over Arbitrary Galois Extensions and Rank Analogues of Reed--Muller Codes ⋮ MRD codes with maximum idealizers ⋮ A new family of maximum scattered linear sets in PG(1, q^6) ⋮ Asymptotics of Moore exponent sets ⋮ A geometric approach to rank metric codes and a classification of constant weight codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set ⋮ Encoding and decoding of several optimal rank metric codes ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Rank-Metric Codes and Their Applications
Cites Work
- Unnamed Item
- Unnamed Item
- Non-linear maximum rank distance codes
- Rank-metric codes and their duality theory
- Algebraic structures of MRD codes
- Constant rank-distance sets of Hermitian matrices and partial spreads in Hermitian polar spaces
- Symmetric bilinear forms over finite fields with applications to coding theory
- Determination of division algebras with 243 elements
- Generalized twisted Gabidulin codes
- A geometric construction of finite semifields
- Translation dual of a semifield
- Subspaces of matrices with special rank properties
- Galois theory and linear algebra
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Theory of codes with maximum rank distance
- On a Kaplansky conjecture concerning three-dimensional division algebras over a finite field
- Bilinear forms over a finite field, with applications to coding theory
- The collineation groups of generalized twisted field planes
- Translation planes of order 27
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- On embeddings of minimum dimension of \(\mathrm{PG}(n,q)\times \mathrm{PG}(n,q)\)
- Symmetric rank codes
- Generalized twisted fields
- Scattered spaces in Galois geometry
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Finite semifields with a large nucleus and higher secant varieties to Segre varieties
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Isometries for rank distance and permutation group of gabidulin codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On a Special Class of Polynomials
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Blocking sets and derivable partial spreads
This page was built for publication: A new family of linear maximum rank distance codes
