Common Complements of Linear Subspaces and the Sparseness of MRD Codes
From MaRDI portal
Publication:5073706
DOI10.1137/21M1428947OpenAlexW3096146904MaRDI QIDQ5073706FDOQ5073706
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
Recommendations
Asymptotic enumeration (05A16) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bilinear forms over a finite field, with applications to coding theory
- Title not available (Why is that?)
- On t-covers in finite projective spaces
- Theory of codes with maximum rank distance
- Existence of \(q\)-analogs of Steiner systems
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Maximum-rank array codes and their application to crisscross error correction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular elements of geometric lattices
- Polynomial LYM inequalities
- Quadratic and symmetric bilinear forms over finite fields and their association schemes
- Maximum scattered linear sets and MRD-codes
- On the genericity of maximum rank distance and Gabidulin codes
- New semifields and new MRD codes from skew polynomial rings
- Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations
- Title not available (Why is that?)
- Rank-metric codes and \(q\)-polymatroids
- Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
- Complements of Linear Subspaces
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Rook theory of the finite general linear group
- On the sparseness of certain linear MRD codes
Cited In (12)
- Bounds in the Lee metric and optimal codes
- Rank-metric lattices
- 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
- Rank-metric codes and their applications
- Connections between scattered linear sets and MRD-codes
- Rank-Metric Codes, Semifields, and the Average Critical Problem
- Constructing MRD codes by switching
- Density of free modules over finite chain rings
- Densities of codes of various linearity degrees in translation-invariant metric spaces
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)
