On the distance distribution of codes

DOI10.1109/18.412711zbMath0831.94019OpenAlexW2036600344MaRDI QIDQ4859770

Gil Kalai, Nathan Linial

Publication date: 12 February 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.412711

zbMATH Keywords

binary codelinear programming boundsdistance distribution

Mathematics Subject Classification ID

Bounds on codes (94B65) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (9)

Bounds on Distance Distributions in Codes of Given Size ⋮ One more proof of the first linear programming bound for binary codes and two conjectures ⋮ Code spectrum and the reliability function: binary symmetric channel ⋮ Hypercontractivity of Spherical Averages in Hamming Space ⋮ Nonnegative quadratic forms and bounds on orthogonal polynomials ⋮ On the optimum of Delsarte's linear program ⋮ Linear codes with exponentially many light vectors ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Common Information, Noise Stability, and Their Extensions

This page was built for publication: On the distance distribution of codes