MRD codes: constructions and connections
From MaRDI portal
Abstract: This preprint is of a chapter to appear in {it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.). Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (1991), and Cooperstein (1998). Rank-metric codes have seen renewed interest in recent years due to their applications in random linear network coding. MRD codes also have interesting connections to other topics such as semifields (finite nonassociative division algebras), finite geometry, linearized polynomials, and cryptography. In this chapter we will survey the known constructions and applications of MRD codes, and present some open problems.
Recommendations
Cited in
(73)- Theory of codes with maximum rank distance
- On dually almost MRD codes
- On the genericity of maximum rank distance and Gabidulin codes
- Some new non-additive maximum rank distance codes
- Rank-metric complementary dual codes
- On decoding additive generalized twisted Gabidulin codes
- On symmetric and Hermitian rank distance codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- \(r\)-fat linearized polynomials over finite fields
- Constructions of rank metric codes under actions of the unitary groups
- Extending two families of maximum rank distance codes
- Further results on LCD generalized Gabidulin codes
- Non-minimum tensor rank Gabidulin codes
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Systematic maximum sum rank codes
- On certain linearized polynomials with high degree and kernel of small dimension
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Matrix graphs and MRD codes over finite principal ideal rings
- Exceptional scatteredness in prime degree
- Linearized trinomials with maximum kernel
- On a conjecture about maximum scattered subspaces of \(\mathbb{F}_{q^6}\times\mathbb{F}_{q^6}\)
- Several classes of optimal Ferrers diagram rank-metric codes
- On \(q\)-covering designs
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Rank-metric codes, linear sets, and their duality
- On the sparseness of certain linear MRD codes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Identifiers for MRD-codes
- Linear sets from projection of Desarguesian spreads
- Cardinal rank metric codes over Galois rings
- Multi-orbit cyclic subspace codes and linear sets
- New constructions of constant dimension codes by improved inserting construction
- Erasure techniques in MRD codes.
- Codes and Designs Related to Lifted MRD Codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Connections between scattered linear sets and MRD-codes
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- Common Complements of Linear Subspaces and the Sparseness of MRD Codes
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Tensor representation of rank-metric codes
- An Assmus-Mattson theorem for rank metric codes
- Rank-metric codes and their applications
- Construction of LCD-MRD codes of length n > N
- An exponential bound on the number of non-isotopic commutative semifields
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- The interplay of different metrics for the construction of constant dimension codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Combining subspace codes
- Vector space partitions of GF(2)^8
- Constructing MRD codes by switching
- Maximum flag-rank distance codes
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Column cyclic rank metric codes and linear complementary dual rank metric codes
- Null ideals of sets of 3 × 3 similar matrices with irreducible characteristic polynomial
- On the construction of MRD convolutional codes
- Non-linear MRD codes from cones over exterior sets
- Linear complete symmetric rank-distance codes
- On perfect symmetric rank-metric codes
- Completely decomposable rank-metric codes
- Automorphism groups of maximum scattered linear sets in finite projective lines
- New constant dimension subspace codes via generalized coset construction
- On the stabilizer of the graph of linear functions over finite fields
- On MSRD codes, h-designs and disjoint maximum scattered linear sets
- Affine vector space partitions
- Valued rank-metric codes
- An explicit construction of asymptotically optimal \([n=t(2k+1),tk,k]_q\)-AAD families
- Scattered polynomials: an overview on their properties, connections and applications
- Rank-metric codes over arbitrary fields: bounds and constructions
- MRD codes with maximum idealizers
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
This page was built for publication: MRD codes: constructions and connections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299919)
