Linear Programming Bounds
From MaRDI portal
Publication:5013034
zbMath1489.94197arXiv1903.02255MaRDI QIDQ5013034
P. G. Boyvalenkov, Danyo Danev
Publication date: 26 November 2021
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.
Full work available at URL: https://arxiv.org/abs/1903.02255
spherical codescodes in Hamming spacesgeneral linear programming methodsuniversal bounds for codes and designs
Linear programming (90C05) Bounds on codes (94B65) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (1)
This page was built for publication: Linear Programming Bounds
