Rank-Metric Codes, Semifields, and the Average Critical Problem

DOI10.1137/22m1486893arXiv2201.07193MaRDI QIDQ6100610

Alberto Ravagnani, John Sheekey, Ferdinando Zullo, Anina Gruica

Publication date: 22 June 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.07193

zbMATH Keywords

densityasymptotic densitycritical problemrank-metric codesemifieldenumerative combinatoricsMRD code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Asymptotic enumeration (05A16) Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• Automorphism groups of Gabidulin-like codes
• Symmetric bilinear forms over finite fields with applications to coding theory
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Alternating bilinear forms over GF(q)
• 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
• Commutative semifields and symplectic spreads.
• Hermitian rank distance codes
• Duality of codes supported on regular lattices, with an application to enumerative combinatorics
• On the genericity of maximum rank distance and Gabidulin codes
• \(n\)-dimensional algebras over a field with a cyclic extension of degree \(n\)
• Algebre tridimensionali su un campo di Galois
• On maximum additive Hermitian rank-metric codes
• On equivalence of maximum additive symmetric rank-distance codes
• Automorphism groups and new constructions of maximum additive rank metric codes with restrictions
• Arcs in finite projective spaces
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• On the sparseness of certain linear MRD codes
• Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set
• On kernels and nuclei of rank metric codes
• Linearized polynomials over finite fields revisited
• Improved explicit estimates on the number of solutions of equations over a finite field
• Generalized twisted fields
• Representation by quadratic forms in a finite field
• Representations by hermitian forms in a finite field
• On the nuclei of a finite semifield
• 13. MRD codes: constructions and connections
• Fundamentals of Error-Correcting Codes
• Symplectic semifield planes and ℤ₄–linear codes
• Common Complements of Linear Subspaces and the Sparseness of MRD Codes
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
• New semifields and new MRD codes from skew polynomial rings
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• An exponential bound on the number of non-isotopic commutative semifields

This page was built for publication: Rank-Metric Codes, Semifields, and the Average Critical Problem