Linear programming bounds for codes via a covering argument
From MaRDI portal
Publication:1017926
DOI10.1007/s00454-008-9128-0zbMath1173.90475arXivmath/0702425MaRDI QIDQ1017926
Alex Samorodnitsky, Michael I. Navon
Publication date: 13 May 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702425
90C05: Linear programming
65T50: Numerical methods for discrete and fast Fourier transforms
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров, Linear programming bounds for codes via a covering argument, Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming bounds for codes via a covering argument
- Optima of dual integer linear programs
- On the ratio of optimal integral and fractional covers
- New upper bounds on sphere packings. I
- An upper bound on the covering radius as a function of the dual distance
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- On relations between covering radius and dual distance
- Generalized Alon--Boppana Theorems and Error-Correcting Codes
