## Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography

- Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu
- IEEE Transactions on Information Theory
- 2005

Highly Influenced

@article{Brouwer1993TheLP, title={The linear programming bound for binary linear codes}, author={Andries E. Brouwer}, journal={IEEE Trans. Information Theory}, year={1993}, volume={39}, pages={677-680} }

- Published 1993 in IEEE Trans. Information Theory
DOI:10.1109/18.212302

Combining Delsarte’s linear programming bound with the information that certain weights cannot occur, new upper bounds for d,,, ( n . I , ), the maximum possible minimum distance of a binary linear code with given word length I I and dimension k , are derived.

Highly Cited

This paper has 21 citations. REVIEW CITATIONS