Common Complements of Linear Subspaces and the Sparseness of MRD Codes

DOI10.1137/21M1428947MaRDI QIDQ5073706zbMATH OpenOpenAlexFDO

Authors Anina Gruica, Alberto Ravagnani

Publication date 3 May 2022

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

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

zbMATH Keywords

densityrank-metric codeMRD code

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• On the sparseness of certain linear MRD codes
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• MRD codes: constructions and connections
• scientific article; zbMATH DE number 2154122

Cites work

• scientific article; zbMATH DE number 3886512 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 4027488 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 952950 (Why is no real title available?)
• scientific article; zbMATH DE number 3342868 (Why is no real title available?)
• scientific article; zbMATH DE number 3365297 (Why is no real title available?)
• A Rank-Metric Approach to Error Control in Random Network Coding
• Bilinear forms over a finite field, with applications to coding theory
• Coding for Errors and Erasures in Random Network Coding
• Complements of Linear Subspaces
• Existence of q-analogs of Steiner systems
• Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
• Maximum scattered linear sets and MRD-codes
• Maximum-rank array codes and their application to crisscross error correction
• Modular elements of geometric lattices
• New semifields and new MRD codes from skew polynomial rings
• On t-covers in finite projective spaces
• On the genericity of maximum rank distance and Gabidulin codes
• On the sparseness of certain linear MRD codes
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• Polynomial LYM inequalities
• Quadratic and symmetric bilinear forms over finite fields and their association schemes
• Rank-metric codes and \(q\)-polymatroids
• Rook theory of the finite general linear group
• Theory of codes with maximum rank distance
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices

Cited in

(17)

• Densities of codes of various linearity degrees in translation-invariant metric spaces
• Bounds in the Lee metric and optimal codes
• Rank-metric lattices
• Valued rank-metric codes
• Generalised evasive subspaces
• Structure of CSS and CSS-T quantum codes
• Maximum weight codewords of a linear rank-metric code
• Linear cutting blocking sets and minimal codes in the rank metric
• On the construction of MRD convolutional codes
• Connections between scattered linear sets and MRD-codes
• Rank-metric codes and their applications
• Linear codes in the folded Hamming distance and the quasi MDS property
• Density of free modules over finite chain rings
• Rank-Metric Codes, Semifields, and the Average Critical Problem
• Constructing MRD codes by switching
• Better bounds on the minimum Lee distance
• Whitney numbers of rank-metric lattices and code enumeration

This page was built for publication: Common Complements of Linear Subspaces and the Sparseness of MRD Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5073706)