Strong blocking sets and minimal codes from expander graphs
type: Item
instance of: scholarly article
title: Strong blocking sets and minimal codes from expander graphs
zbMATH Open document ID: 1543.51007
author: Noga Alon
author: Anurag Bishnoi
author: Shagnik Das
author: Alessandro Neri
published in: Transactions of the American Mathematical Society
publication date: 2024-07-12T00:00:00Z
Mathematics Subject Classification ID: 51E21
Mathematics Subject Classification ID: 51E22
Mathematics Subject Classification ID: 05C48
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 7880402
zbMATH Keywords: strong blocking set
zbMATH Keywords: minimal linear codes
MaRDI profile type: MaRDI publication profile
cites work: A geometric characterization of minimal codes and their asymptotic performance
cites work: Outer strong blocking sets
cites work: Three Combinatorial Perspectives on Minimal Codes
cites work: Explicit expanders of every degree and size
cites work: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
cites work: Minimal vectors in linear codes
cites work: A survey of integrity
cites work: Two results about the hypercube
cites work: Q3789603
cites work: Minimal Linear Codes in Odd Characteristic
cites work: Small Strong Blocking Sets by Concatenation
cites work: On cutting blocking sets and their codes
cites work: Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
cites work: Minimal linear codes arising from blocking sets
cites work: The blocking number of an affine space
cites work: Linear intersecting codes
cites work: Yet another variation on minimal linear codes
cites work: Intersecting codes and independent families
cites work: Algebraic geometry codes and some applications
cites work: Linear nonbinary covering codes and saturating sets in projective spaces
cites work: Linear Codes From Some 2-Designs
cites work: Q3428807
cites work: Lines in higgledy-piggledy arrangement
cites work: A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
cites work: On the asymptotic behaviour of some towers of function fields over finite fields
cites work: Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
cites work: Search problems in vector spaces
cites work: Expander graphs and their applications
cites work: Decoding linear block codes for minimizing word error rate (Corresp.)
cites work: Covering finite fields with cosets of subspaces
cites work: Class of constructive asymptotically good algebraic codes
cites work: On a problem of K. Zarankiewicz
cites work: Field reduction and linear sets in finite geometry
cites work: Ramanujan graphs
cites work: Linear binary codes with intersection properties
cites work: Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
cites work: On the second eigenvalue of a graph
cites work: On the lower bound for the length of minimal codes
cites work: Expander codes
cites work: Explicit, almost optimal, epsilon-balanced codes
cites work: Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
cites work: A recursive approach to low complexity codes
cites work: Q3997777
cites work: Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
cites work: Pseudorandomness
cites work: The integrity of a cubic graph
cites work: Explicit constructions of perfect hash families from algebraic curves over finite fields
DOI: 10.1090/TRAN/9205
description: scientific article; zbMATH DE number 7880402