Semidefinite programming bounds for error-correcting codes
Frank Vallentin
TL;DR
This chapter discusses the use of semidefinite programming to establish bounds for error-correcting codes, providing foundational insights for students and researchers in coding theory.
Contribution
It introduces semidefinite programming bounds specifically tailored for error-correcting codes, offering a new mathematical approach in the field.
Findings
Semidefinite programming provides tighter bounds for error-correcting codes.
The chapter offers comprehensive references and foundational concepts.
It emphasizes the importance of these bounds in coding theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Optimization Algorithms Research · Numerical Methods and Algorithms