Strong blocking sets and minimal codes from expander graphs
DOI10.1090/TRAN/9205zbMATH Open1543.51007MaRDI QIDQ6571606FDOQ6571606
Authors: Noga Alon, Anurag Bishnoi, Shagnik Das, Alessandro Neri 
Publication date: 12 July 2024
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of finite geometries (05B25) Connectivity (05C40) 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) Expander graphs (05C48)
Cites Work
- Field reduction and linear sets in finite geometry
- Linear intersecting codes
- On the asymptotic behaviour of some towers of function fields over finite fields
- Yet another variation on minimal linear codes
- Expander codes
- Expander graphs and their applications
- Minimal vectors in linear codes
- Intersecting codes and independent families
- Linear nonbinary covering codes and saturating sets in projective spaces
- Ramanujan graphs
- Title not available (Why is that?)
- On a problem of K. Zarankiewicz
- Covering finite fields with cosets of subspaces
- The blocking number of an affine space
- Lines in higgledy-piggledy arrangement
- Search problems in vector spaces
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- The integrity of a cubic graph
- Linear Codes From Some 2-Designs
- On the second eigenvalue of a graph
- A survey of integrity
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Title not available (Why is that?)
- Linear binary codes with intersection properties
- A recursive approach to low complexity codes
- Title not available (Why is that?)
- Decoding linear block codes for minimizing word error rate (Corresp.)
- Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
- Pseudorandomness
- Class of constructive asymptotically good algebraic codes
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Explicit expanders of every degree and size
- Two results about the hypercube
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- A geometric characterization of minimal codes and their asymptotic performance
- Explicit, almost optimal, epsilon-balanced codes
- Algebraic geometry codes and some appliations
- Minimal linear codes arising from blocking sets
- Minimal linear codes in odd characteristic
- Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
- On cutting blocking sets and their codes
- Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
- Three combinatorial perspectives on minimal codes
- Small Strong Blocking Sets by Concatenation
- On the lower bound for the length of minimal codes
- Outer strong blocking sets
Cited In (1)
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)
