Three combinatorial perspectives on minimal codes
From MaRDI portal
Abstract: We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic combinatorics, describing the supports in a linear code via the Alon-F"uredi Theorem and the Combinatorial Nullstellensatz. The second approach combines methods from coding theory and statistics to compare the mean and variance of the nonzero weights in a minimal code. Finally, the third approach regards minimal codes as cutting blocking sets and studies these using the theory of spreads in finite geometry. Applying and combining these approaches with each other, we derive several new bounds and constraints on the parameters of minimal codes. Moreover, we obtain two new constructions of cutting blocking sets of small cardinality in finite projective spaces. In turn, these allow us to give explicit constructions of minimal codes having short length for the given field and dimension.
Recommendations
Cites work
- A Better Bound on the Variance
- A geometric characterization of minimal codes and their asymptotic performance
- Affine Cartesian codes
- An inductive construction of minimal codes
- Blocking sets in projective spaces
- Codes, cryptology and curves with computer algebra
- Combinatorial Nullstellensatz
- Covering the cube by affine hyperplanes
- Decoding linear block codes for minimizing word error rate (Corresp.)
- Field reduction and linear sets in finite geometry
- 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
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3894973 (Why is no real title available?)
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Linear Codes From Some 2-Designs
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- 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
- Lines in higgledy-piggledy arrangement
- Minimal linear codes arising from blocking sets
- Minimal linear codes in odd characteristic
- Minimal vectors in linear codes
- Multiple Blocking Sets and Arcs in Finite Planes
- Multiple blocking sets in \(\text{PG}(n,q)\), \(n \geq 3\)
- On Baer subspaces of finite projective spaces
- On cutting blocking sets and their codes
- On minimal and quasi-minimal linear codes
- On the size of a double blocking set in \(\text{PG}(2,q)\)
- On zeros of a polynomial in a finite grid
- Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane
- The parameters of minimal linear codes
- Towards secure two-party computation from the wire-tap channel
- Weighted Reed-Muller codes revisited
Cited in
(25)- A geometric characterization of minimal codes and their asymptotic performance
- Higgledy-piggledy sets in projective spaces of small dimension
- Linear cutting blocking sets and minimal codes in the rank metric
- Small Strong Blocking Sets by Concatenation
- On the lower bound for the length of minimal codes
- On the minimum number of minimal codewords
- Minimal codewords in norm-trace codes
- Saturating systems and the rank-metric covering radius
- Covering grids with multiplicity
- Outer strong blocking sets
- Minimal linear codes constructed from partial spreads
- Strong blocking sets and minimal codes from expander graphs
- Minimal linear codes derived from weakly regular bent and plateaued functions
- Minimal linear codes constructed from hierarchical posets with two levels
- Minimal binary codewords derived from the incidence-matrix approach
- Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
- Minimal linear codes from vectorial functions
- A note on strong blocking sets and higgledy-piggledy sets of lines
- Trifferent codes with small lengths
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- All minimal \([9, 4]_2\)-codes are hyperbolic quadrics
- Minimal codewords over finite fields derived from certain graphs
- The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- Expander graphs, strong blocking sets and minimal codes (extended abstract)
- Linear codes arising from the point-hyperplane geometry. II: The twisted embedding
This page was built for publication: Three combinatorial perspectives on minimal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5062110)
