Minimal linear codes arising from blocking sets
From MaRDI portal
Abstract: Minimal linear codes are algebraic objects which gained interest in the last twenty years, due to their link with Massey's secret sharing schemes. In this context, Ashikhmin and Barg provided a useful and a quite easy to handle sufficient condition for a linear code to be minimal, which has been applied in the construction of many minimal linear codes. In this paper, we generalize some recent constructions of minimal linear codes which are not based on Ashikhmin-Barg's condition. More combinatorial and geometric methods are involved in our proofs. In particular, we present a family of codes arising from particular blocking sets, which are well-studied combinatorial objects. In this context, we will need to define cutting blocking sets and to prove some of their relations with other notions in blocking sets' theory. At the end of the paper, we provide one explicit family of cutting blocking sets and related minimal linear codes, showing that infinitely many of its members do not satisfy the Ashikhmin-Barg's condition.
Recommendations
Cites work
- scientific article; zbMATH DE number 3651315 (Why is no real title available?)
- scientific article; zbMATH DE number 2040937 (Why is no real title available?)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Current research topics in Galois geometry
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- Fundamentals of Error-Correcting Codes
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Minimal Binary Linear Codes
- Minimal linear codes in odd characteristic
- Minimal linear codes over finite fields
- Minimal vectors in linear codes
- On the inherent intractability of certain coding problems (Corresp.)
- The hardness of decoding linear codes with preprocessing
- Towards secure two-party computation from the wire-tap channel
Cited in
(28)- 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
- Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\)
- On the minimum number of minimal codewords
- Constructing saturating sets in projective spaces using subgeometries
- 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
- Blocking sets, minimal codes and trifferent codes
- Three combinatorial perspectives on minimal codes
- Minimal codewords arising from the incidence of points and hyperplanes in projective spaces
- 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
- Some hypersurfaces over finite fields, minimal codes and secret sharing schemes
- Minimal linear codes constructed from hierarchical posets with two levels
- An inductive construction of minimal codes
- Outer strong blocking sets
- Minimal linear codes from Hermitian varieties and quadrics
- Minimal trellises for block codes
- On the weight distribution of some minimal codes
- Small Strong Blocking Sets by Concatenation
- Infinite families of minimal binary codes via Krawtchouk polynomials
This page was built for publication: Minimal linear codes arising from blocking sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2025113)
