On the genericity of maximum rank distance and Gabidulin codes
From MaRDI portal
Publication:1696049
DOI10.1007/s10623-017-0354-4zbMath1412.94247arXiv1605.05972OpenAlexW3103202762MaRDI QIDQ1696049
Anna-Lena Horlemann-Trautmann, Alessandro Neri, Joachim Rosenthal, Tovohery Hajatiana Randrianarisoa
Publication date: 14 February 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.05972
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Related Items (22)
On the number of inequivalent Gabidulin codes ⋮ Common Complements of Linear Subspaces and the Sparseness of MRD Codes ⋮ On \(q\)-Steiner systems from rank metric codes ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ Nuclei and automorphism groups of generalized twisted Gabidulin codes ⋮ Weighted subspace designs from \(q\)-polymatroids ⋮ Rank-Metric Codes, Semifields, and the Average Critical Problem ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Densities of codes of various linearity degrees in translation-invariant metric spaces ⋮ Some matroids related to sum-rank metric codes ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Bounds in the Lee metric and optimal codes ⋮ A new rank metric for convolutional codes ⋮ LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding ⋮ Partition-balanced families of codes and asymptotic enumeration in coding theory ⋮ Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\) ⋮ Random construction of partial MDS codes ⋮ On the sparseness of certain linear MRD codes ⋮ Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices ⋮ MRD codes with maximum idealizers ⋮ Rank-Metric Codes and Their Applications ⋮ Rank-metric lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-linear maximum rank distance codes
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Isometries for rank distance and permutation group of gabidulin codes
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
This page was built for publication: On the genericity of maximum rank distance and Gabidulin codes
