𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Matsumoto, R.; Kurosawa, K.; Itoh, T.; Konno, T.; Uyematsu, T.

Book ID
114640396
Publisher
IEEE
Year
2006
Tongue
English
Weight
245 KB
Volume
52
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. TietΓ€vΓ€inen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole Β΄ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta Β¨ va Β¨ inen's bound .