Spectral approach to linear programming bounds on codes

DOI10.1134/S0032946006020025zbMath1237.94147arXivcs/0512024OpenAlexW2953009186MaRDI QIDQ415647

Alexander Barg, Dmitrii Yu. Nogin

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65)

Related Items (1)

Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear programming bounds for codes in grassmannian spaces
• Bound on the Extreme Zeros of Orthogonal Polynomials
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces

This page was built for publication: Spectral approach to linear programming bounds on codes