Common Complements of Linear Subspaces and the Sparseness of MRD Codes
From MaRDI portal
Publication:5073706
DOI10.1137/21M1428947OpenAlexW3096146904MaRDI QIDQ5073706
Alberto Ravagnani, Anina Gruica
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Asymptotic enumeration (05A16)
Related Items (7)
Density of free modules over finite chain rings ⋮ Linear cutting blocking sets and minimal codes in the rank metric ⋮ Rank-Metric Codes, Semifields, and the Average Critical Problem ⋮ Densities of codes of various linearity degrees in translation-invariant metric spaces ⋮ Bounds in the Lee metric and optimal codes ⋮ Rank-Metric Codes and Their Applications ⋮ Rank-metric lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- On t-covers in finite projective spaces
- Bilinear forms over a finite field, with applications to coding theory
- Maximum scattered linear sets and MRD-codes
- On the genericity of maximum rank distance and Gabidulin codes
- Rank-metric codes and \(q\)-polymatroids
- Quadratic and symmetric bilinear forms over finite fields and their association schemes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- On the sparseness of certain linear MRD codes
- Modular elements of geometric lattices
- Polynomial LYM inequalities
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS
- Complements of Linear Subspaces
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- 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
- Maximum-rank array codes and their application to crisscross error correction
- Rook Theory of the Finite General Linear Group
This page was built for publication: Common Complements of Linear Subspaces and the Sparseness of MRD Codes
