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
(70)- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Automorphism groups of maximum scattered linear sets in finite projective lines
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
- New constant dimension subspace codes via generalized coset construction
- Linearized trinomials with maximum kernel
- Rank-metric codes, linear sets, and their duality
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Identifiers for MRD-codes
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Tensor representation of rank-metric codes
- Codes and Designs Related to Lifted MRD Codes
- Maximum flag-rank distance codes
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- On \(q\)-covering designs
- An Assmus-Mattson theorem for rank metric codes
- Affine vector space partitions
- Valued rank-metric codes
- New constructions of constant dimension codes by improved inserting construction
- Rank-metric complementary dual codes
- \(r\)-fat linearized polynomials over finite fields
- Column cyclic rank metric codes and linear complementary dual rank metric codes
- Extending two families of maximum rank distance codes
- On certain linearized polynomials with high degree and kernel of small dimension
- Construction of LCD-MRD codes of length n > N
- On a conjecture about maximum scattered subspaces of \(\mathbb{F}_{q^6}\times\mathbb{F}_{q^6}\)
- On MSRD codes, h-designs and disjoint maximum scattered linear sets
- Cardinal rank metric codes over Galois rings
- An exponential bound on the number of non-isotopic commutative semifields
- Constructions of rank metric codes under actions of the unitary groups
- Theory of codes with maximum rank distance
- Further results on LCD generalized Gabidulin codes
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- Several classes of optimal Ferrers diagram rank-metric codes
- On dually almost MRD codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Non-minimum tensor rank Gabidulin codes
- Some new non-additive maximum rank distance codes
- Combining subspace codes
- On decoding additive generalized twisted Gabidulin codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Null ideals of sets of 3 × 3 similar matrices with irreducible characteristic polynomial
- On symmetric and Hermitian rank distance codes
- Exceptional scatteredness in prime degree
- Cones from maximum \(h\)-scattered linear sets and a stability result for cylinders from hyperovals
- The interplay of different metrics for the construction of constant dimension codes
- Linear complete symmetric rank-distance codes
- Erasure techniques in MRD codes.
- On the construction of MRD convolutional codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Linear sets from projection of Desarguesian spreads
- Matrix graphs and MRD codes over finite principal ideal rings
- Vector space partitions of GF(2)^8
- Non-linear MRD codes from cones over exterior sets
- Connections between scattered linear sets and MRD-codes
- Rank-metric codes and their applications
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- Constructing MRD codes by switching
- On perfect symmetric rank-metric codes
- Equivalence and characterizations of linear rank-metric codes based on invariants
- Multi-orbit cyclic subspace codes and linear sets
- Systematic maximum sum rank codes
- An explicit construction of asymptotically optimal \([n=t(2k+1),tk,k]_q\)-AAD families
- On the genericity of maximum rank distance and Gabidulin codes
- On the stabilizer of the graph of linear functions over finite fields
- On the sparseness of certain linear MRD codes
- Completely decomposable rank-metric codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
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)
