Saturating systems and the rank-metric covering radius

DOI10.1007/S10801-023-01269-9MaRDI QIDQ6185345zbMATH OpenFDO

Authors Matteo Bonini, Martino Borello, Eimear Byrne

Publication date 8 January 2024

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

covering radiuslinear setsrank-metric codesprojective systemssaturating systems

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial structures in finite projective spaces (51E20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Abstract: We introduce the concept of a rank saturating system and outline its correspondence to a rank-metric code with a given covering radius. We consider the problem of finding the value of $s_{q^m/q}(k,ho)$, which is the minimum $mathbb{F}_q$-dimension of a $q$-system in $mathbb{F}_{q^m}^k$ which is rank $ho$-saturating. This is equivalent to the covering problem in the rank metric. We obtain upper and lower bounds on $s_{q^m/q}(k,ho)$ and evaluate it for certain values of $k$ and $ho$. We give constructions of rank $ho$-saturating systems suggested from geometry.

Recommendations

• On saturated k-Sperner systems
• Approximate inverse systems of compacta and covering dimension
• Covering radius---Survey and recent results
• scientific article; zbMATH DE number 3304125
• Covering and metric regularity
• Saturating sets in projective planes and hypergraph covers
• scientific article; zbMATH DE number 1782550
• scientific article; zbMATH DE number 59914
• Transfering saturation, the finite cover property, and stability
• The asymptotic rank of metric spaces

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• A geometric approach to rank metric codes and a classification of constant weight codes
• A geometric characterization of minimal codes and their asymptotic performance
• A new family of linear maximum rank distance codes
• Bilinear forms over a finite field, with applications to coding theory
• Codes and projective multisets
• Codes with few weights arising from linear sets
• Constructions and families of covering codes and saturated sets of points in projective geometry
• Covering radius of matrix codes endowed with the rank metric
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Four fundamental parameters of a code and their combinatorial significance
• Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
• Fundamentals of Error-Correcting Codes
• Generalized twisted Gabidulin codes
• Linear cutting blocking sets and minimal codes in the rank metric
• Linear nonbinary covering codes and saturating sets in projective spaces
• Linear sets in finite projective spaces
• Maximum-rank array codes and their application to crisscross error correction
• Minimal linear codes arising from blocking sets
• New MRD codes from linear cutting blocking sets
• Normal spreads
• On defining generalized rank weights
• On saturating sets in projective spaces.
• On saturating sets in small projective geometries
• Packing and Covering Properties of Rank Metric Codes
• Partition-balanced families of codes and asymptotic enumeration in coding theory
• Saturated configurations of points in projective Galois spaces
• Scattered spaces with respect to a spread in \(\text{PG}(n,q)\)
• Scattered subspaces and related codes
• Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
• Short codes with a given covering radius
• Small Strong Blocking Sets by Concatenation
• The Geometry of Two-Weight Codes
• Theory of codes with maximum rank distance
• Three combinatorial perspectives on minimal codes
• Two pointsets in \(\mathrm{PG}(2,q^n)\) and the associated codes

Cited in

(3)

• Saturating linear sets in \(\mathrm{PG}(2,q^4)\)
• Short rank-metric codes and scattered subspaces
• Transfering saturation, the finite cover property, and stability

This page was built for publication: Saturating systems and the rank-metric covering radius

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