Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
From MaRDI portal
Abstract: In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking sets. As a direct result, minimal projective codes of dimension and -fold blocking sets with in projective planes are identical objects. Some bounds on the parameters of minimal codes are derived from this characterization. This confirms a recent conjecture by Alfarano, Borello and Neri in [a geometric characterization of minimal codes and their asymptotic performance, arXiv:1911.11738, 2019] about a lower bound of the minimum distance of a minimal code. Using this new link between minimal codes and blocking sets, we also present new general primary and secondary constructions of minimal linear codes. As a result, infinite families of minimal linear codes not satisfying the Aschikhmin-Barg's condition are obtained. In addition to this, the weight distributions of two subfamilies of the proposed minimal linear codes are established. Open problems are also presented.
Cited in
(33)- Several classes of linear codes with few weights over finite fields
- The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- A geometric characterization of minimal codes and their asymptotic performance
- Strong blocking sets and minimal codes from expander graphs
- Minimal linear codes from weakly regular bent functions
- Minimal linear codes constructed from partial spreads
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound
- On cutting blocking sets and their codes
- Expander graphs, strong blocking sets and minimal codes (extended abstract)
- On the minimum number of minimal codewords
- Minimal binary linear codes: a general framework based on bent concatenation
- Minimal linear codes constructed from functions
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class
- Four classes of wide minimal q-ary linear codes from a general method
- Binary self-orthogonal codes with few weights
- Linear codes arising from the point-hyperplane geometry. II: The twisted embedding
- Three combinatorial perspectives on minimal codes
- Saturating systems and the rank-metric covering radius
- Higgledy-piggledy sets in projective spaces of small dimension
- Linear cutting blocking sets and minimal codes in the rank metric
- On the lower bound for the length of minimal codes
- Minimal codes derived from plateaued functions over \(\mathbb{F}_5\)
- Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
- Minimal linear codes from vectorial functions
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Minimal linear codes constructed from hierarchical posets with two levels
- A note on strong blocking sets and higgledy-piggledy sets of lines
- Trifferent codes with small lengths
- Outer strong blocking sets
- The geometry of covering codes in the sum-rank metric
- Optimal binary linear codes from posets of the disjoint union of two chains
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- Small Strong Blocking Sets by Concatenation
This page was built for publication: Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001750)
