# Linear Programming Bounds

**Authors:** Peter Boyvalenkov, Danyo Danev

arXiv: 1903.02255 · 2019-03-07

## TL;DR

This chapter provides foundational definitions, examples, and basic facts about linear programming bounds in coding theory, aimed at upper-level students and researchers.

## Contribution

It offers a concise, reference-style overview of linear programming bounds, emphasizing clarity and foundational knowledge for educational purposes.

## Key findings

- Summarizes key concepts and definitions
- Provides illustrative examples
- Includes exhaustive references

## 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 text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1903.02255/full.md

## References

75 references — full list in the complete paper: https://tomesphere.com/paper/1903.02255/full.md

---
Source: https://tomesphere.com/paper/1903.02255