Minimal linear codes arising from blocking sets
From MaRDI portal
Publication:2025113
DOI10.1007/s10801-019-00930-6zbMath1489.94130arXiv1907.04626OpenAlexW3008041837MaRDI QIDQ2025113
Matteo Bonini, Martino Borello
Publication date: 11 May 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04626
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Blocking sets, ovals, (k)-arcs (51E21) Authentication, digital signatures and secret sharing (94A62)
Related Items
An inductive construction of minimal codes, Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound, On cutting blocking sets and their codes, Small Strong Blocking Sets by Concatenation, Minimal linear codes from weakly regular bent functions, Minimal binary linear codes: a general framework based on bent concatenation, Three Combinatorial Perspectives on Minimal Codes, Minimal linear codes constructed from functions, Higgledy-piggledy sets in projective spaces of small dimension, On the weight distribution of some minimal codes, Constructing saturating sets in projective spaces using subgeometries, Linear cutting blocking sets and minimal codes in the rank metric, Several families of \(q\)-ary minimal linear codes with \(w_{\min}/w_{\max} \leq (q-1)/q\), Some hypersurfaces over finite fields, minimal codes and secret sharing schemes, On the lower bound for the length of minimal codes, Minimal codewords arising from the incidence of points and hyperplanes in projective spaces, On the minimum number of minimal codewords, Saturating systems and the rank-metric covering radius, Minimal linear codes from Hermitian varieties and quadrics, Wide minimal binary linear codes from the general Maiorana-Mcfarland class, A geometric characterization of minimal codes and their asymptotic performance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes from simplicial complexes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Minimal linear codes over finite fields
- Four families of minimal binary linear codes with \(w_{\min }/w_{\max }\le 1/2\)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Towards Secure Two-Party Computation from the Wire-Tap Channel
- The hardness of decoding linear codes with preprocessing
- Fundamentals of Error-Correcting Codes
- On the inherent intractability of certain coding problems (Corresp.)
- Minimal Binary Linear Codes
- Minimal vectors in linear codes
- Minimal Linear Codes in Odd Characteristic
