Saturating systems and the rank-metric covering radius
DOI10.1007/s10801-023-01269-9arXiv2206.14740MaRDI QIDQ6185345
Martino Borello, Eimear Byrne, Matteo Bonini
Publication date: 8 January 2024
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.14740
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial structures in finite projective spaces (51E20) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- A new family of linear maximum rank distance codes
- On defining generalized rank weights
- Linear nonbinary covering codes and saturating sets in projective spaces
- Linear sets in finite projective spaces
- Generalized twisted Gabidulin codes
- Curve razionali normali e \(k\)-archi negli spazi finiti
- A geometric approach to rank metric codes and a classification of constant weight codes
- Theory of codes with maximum rank distance
- Saturated configurations of points in projective Galois spaces
- Codes and projective multisets
- Bilinear forms over a finite field, with applications to coding theory
- Normal spreads
- On saturating sets in projective spaces.
- Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
- On saturating sets in small projective geometries
- Minimal linear codes arising from blocking sets
- Scattered subspaces and related codes
- A geometric characterization of minimal codes and their asymptotic performance
- Linear cutting blocking sets and minimal codes in the rank metric
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- New MRD codes from linear cutting blocking sets
- Packing and Covering Properties of Rank Metric Codes
- The Geometry of Two-Weight Codes
- Short codes with a given covering radius
- Fundamentals of Error-Correcting Codes
- Constructions and families of covering codes and saturated sets of points in projective geometry
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Three Combinatorial Perspectives on Minimal Codes
- Four fundamental parameters of a code and their combinatorial significance
- Covering Radius of Matrix Codes Endowed with the Rank Metric
- Maximum-rank array codes and their application to crisscross error correction
- Small Strong Blocking Sets by Concatenation
- Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes
- Codes with few weights arising from linear sets
This page was built for publication: Saturating systems and the rank-metric covering radius
