✦ LIBER ✦

A bound for divisible codes

✍ Scribed by Ward, H.N.

Book ID: 114539522
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 352 KB
Volume: 38
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.108271

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weights Modulo a Prime Power in Divisibl

Weights Modulo a Prime Power in Divisible Codes and a Related Bound

✍ Xiaoyu Liu 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 219 KB

The Divisible Code Bound Revisited

✍ Harold N. Ward 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a character-free proof of the divisible code bound and some applications.

Divisibility of Codes Meeting the Griesm

Divisibility of Codes Meeting the Griesmer Bound

✍ Harold N. Ward 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We prove that if a linear code over GF( p), p a prime, meets the Griesmer bound, then if p e divides the minimum weight, p e divides all word weights. We present some illustrative applications of this result.

On a Fallacious Bound for Authentication

On a Fallacious Bound for Authentication Codes

✍ Carlo Blundo; Alfredo De Santis; Kaoru Kurosawa; Wakaha Ogata 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 47 KB

A weight distribution bound for linear c

A weight distribution bound for linear codes

✍ Levy, J. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 565 KB

A lower bound for 0,1,∗ tournament codes

✍ Karen L. Collins; Peter W. Shor; John R. Stembridge 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 220 KB