One more proof of the first linear programming bound for binary codes and two conjectures

DOI10.1007/s11856-023-2514-8zbMath1530.94061arXiv2104.14587OpenAlexW3158852179MaRDI QIDQ6050274

Alex Samorodnitsky

Publication date: 12 October 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.14587

zbMATH Keywords

binary codesfirst linear programming bound

Mathematics Subject Classification ID

Linear programming (90C05) Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming bounds for codes via a covering argument
• Linear codes and character sums
• Comparison of moments of Rademacher chaoses
• On the \(\ell_4:\ell_2\) ratio of functions with restricted Fourier support
• Invariant Semidefinite Programs
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• An inequality for the trace of the product of two symmetric matrices
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Estimates of the distance distribution of codes and designs
• Random codes: minimum distances and error exponents
• On the distance distribution of codes
• A Moment Ratio Bound for Polynomials and Some Extremal Properties of Krawchouk Polynomials and Hamming Spheres
• Analysis of Boolean Functions
• Semidefinite Code Bounds Based on Quadruple Distances
• Generalized Alon--Boppana Theorems and Error-Correcting Codes
• Linear codes with exponentially many light vectors

This page was built for publication: One more proof of the first linear programming bound for binary codes and two conjectures