Strong blocking sets and minimal codes from expander graphs
From MaRDI portal
Combinatorial aspects of finite geometries (05B25) Connectivity (05C40) Expander graphs (05C48) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Blocking sets, ovals, (k)-arcs (51E21) Linear codes and caps in Galois spaces (51E22) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Recommendations
Cites work
- A geometric characterization of minimal codes and their asymptotic performance
- A recursive approach to low complexity codes
- A survey of integrity
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Algebraic geometry codes and some appliations
- Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
- Class of constructive asymptotically good algebraic codes
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Covering finite fields with cosets of subspaces
- Decoding linear block codes for minimizing word error rate (Corresp.)
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Expander codes
- Expander graphs and their applications
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Explicit expanders of every degree and size
- Explicit, almost optimal, epsilon-balanced codes
- Field reduction and linear sets in finite geometry
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- scientific article; zbMATH DE number 5138821 (Why is no real title available?)
- scientific article; zbMATH DE number 4053662 (Why is no real title available?)
- scientific article; zbMATH DE number 48941 (Why is no real title available?)
- Intersecting codes and independent families
- Linear binary codes with intersection properties
- Linear Codes From Some 2-Designs
- Linear intersecting codes
- 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
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- On a problem of K. Zarankiewicz
- On cutting blocking sets and their codes
- On the asymptotic behaviour of some towers of function fields over finite fields
- On the lower bound for the length of minimal codes
- On the second eigenvalue of a graph
- Outer strong blocking sets
- Pseudorandomness
- Ramanujan graphs
- Search problems in vector spaces
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Small Strong Blocking Sets by Concatenation
- The blocking number of an affine space
- The integrity of a cubic graph
- Three combinatorial perspectives on minimal codes
- Two results about the hypercube
- Yet another variation on minimal linear codes
Cited in
(9)- Blocking sets, minimal codes and trifferent codes
- Outer strong blocking sets
- A unified framework for the expander mixing lemma for irregular graphs and its applications
- Linear codes arising from the point-hyperplane geometry. I: The Segre embedding
- A note on strong blocking sets and higgledy-piggledy sets of lines
- Characterizations for minimal codes: graph theory approach and algebraic approach over finite chain rings
- The geometry of intersecting codes and applications to additive combinatorics and factorization theory
- Ramanujan polar graphs
- A note on short minimal codes from subgeometries
This page was built for publication: Strong blocking sets and minimal codes from expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571606)
