A new proof of several inequalities on codes and sets

DOI10.1016/0097-3165(95)90021-7zbMath0826.05053OpenAlexW1996198376MaRDI QIDQ1894016

László Babai, Richard M. Wilson, Hunter S. Snevily

Publication date: 26 November 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90021-7

zbMATH Keywords

multivariate polynomialsset systemsFrankl-Wilson theoremRay-Chaudhuri-Wilson theoremDelsarte methodinequalities on codes

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items

Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Pairs of codes with prescribed Hamming distances and coincidences ⋮ Quantum weakly nondeterministic communication complexity ⋮ Avoiding right angles and certain Hamming distances ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Bounds on sets with few distances ⋮ Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields ⋮ Bounds on degrees of \(p\)-adic separating polynomials ⋮ Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances ⋮ An upper bound for the size of \(s\)-distance sets in real algebraic sets ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances

Cites Work

• Unnamed Item
• Unnamed Item
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Intersection theorems with geometric consequences
• On t-designs
• Bilinear forms over a finite field, with applications to coding theory
• On Two-Distance Sets in Euclidean Space