Semidefinite programming bounds for error-correcting codes

MaRDI QIDQ5013035zbMATH OpenFDO

Authors Frank Vallentin

Publication date 26 November 2021

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

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 on the model of the Handbook of Finite Fields. The target audience of the Encyclopedia is upper level undergraduates and graduate students.

Cited in

(2)

• Semidefinite bounds for mixed binary/ternary codes
• Highly Robust Error Correction byConvex Programming

This page was built for publication: Semidefinite programming bounds for error-correcting codes

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