Linear programming bounds for doubly-even self-dual codes

DOI10.1109/18.605587zbMath0878.94061OpenAlexW2141028173MaRDI QIDQ4345619

Ilia Krasikov, Simon N. Litsyn

Publication date: 13 January 1998

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

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

zbMATH Keywords

upper boundKrawtchouk polynomialsminimum distancedoubly-even self-dual codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items

Estimates of the distance distribution of codes and designs, Quantum stabilizer codes, lattices, and CFTs, The shadow theory of modular and unimodular lattices