Three Combinatorial Perspectives on Minimal Codes
From MaRDI portal
Publication:5062110
DOI10.1137/21M1391493zbMath1506.94088arXiv2010.16339OpenAlexW4213117239MaRDI QIDQ5062110
Gianira N. Alfarano, Alberto Ravagnani, Alessandro Neri, Martino Borello
Publication date: 15 March 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.16339
spreadcombinatorial Nullstellensatzminimal codestrong blocking setcutting blocking setPless identity
Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial structures in finite projective spaces (51E20)
Related Items
Small Strong Blocking Sets by Concatenation ⋮ 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 codewords in norm-trace codes ⋮ Saturating systems and the rank-metric covering radius ⋮ Covering grids with multiplicity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lines in higgledy-piggledy arrangement
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Linear nonbinary covering codes and saturating sets in projective spaces
- Covering the cube by affine hyperplanes
- On the size of a double blocking set in \(\text{PG}(2,q)\)
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- On Baer subspaces of finite projective spaces
- Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
- Weighted Reed-Muller codes revisited
- Minimal linear codes arising from blocking sets
- A geometric characterization of minimal codes and their asymptotic performance
- An inductive construction of minimal codes
- On cutting blocking sets and their codes
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- Affine Cartesian codes
- The parameters of minimal linear codes
- A Better Bound on the Variance
- On Minimal and Quasi-minimal Linear Codes
- Linear Codes From Some 2-Designs
- Field reduction and linear sets in finite geometry
- Towards Secure Two-Party Computation from the Wire-Tap Channel
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Fundamentals of Error-Correcting Codes
- Decoding linear block codes for minimizing word error rate (Corresp.)
- Combinatorial Nullstellensatz
- Multiple Blocking Sets and Arcs in Finite Planes
- On Zeros of a Polynomial in a Finite Grid
- Minimal vectors in linear codes
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- Four fundamental parameters of a code and their combinatorial significance
- Minimal Linear Codes in Odd Characteristic
- Codes, Cryptology and Curves with Computer Algebra
This page was built for publication: Three Combinatorial Perspectives on Minimal Codes
