Linear programming bounds

MaRDI QIDQ5013034zbMATH OpenFDO

Authors Peter Boyvalenkov, Danyo Danev

Publication date 26 November 2021

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

zbMATH Keywords

codes in Hamming spacesgeneral linear programming methodsspherical codesuniversal bounds for codes and designs

Mathematics Subject Classification ID

Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Bounds on codes (94B65)

Abstract: This chapter is written for the forthcoming book "A Concise Encyclopedia of Coding Theory" (CRC press), edited by W. Cary Huffman, Jon-Lark Kim, and Patrick Sol'e. This book will collect short but foundational articles, emphasizing definitions, examples, exhaustive references, and basic facts. The target audience of the Encyclopedia is upper level undergraduates and graduate students.

Recommendations

• On linear programming bounds for spherical codes and designs
• Linear programming bounds for codes of small size
• Linear programming bounds for unitary codes
• scientific article; zbMATH DE number 1188988
• scientific article; zbMATH DE number 3543912

Cited in

(5)

• Low-Dimensional Linear Programming with Violations
• Linear programming bounds for unitary codes
• Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
• A characterization of Delsarte's linear programming bound as a ratio bound
• Unrestricted variables in linear programming

This page was built for publication: Linear programming bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013034)