✦ LIBER ✦

Two new binary codes with minimum distance three

✍ Scribed by Hamalainen, H.O.

Book ID: 114542111
Publisher: IEEE
Year: 1988
Tongue: English
Weight: 120 KB
Volume: 34
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.9787

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two new bounds on the size of binary cod

Two new bounds on the size of binary codes with a minimum distance of three

✍ Yaron Klein; Simon Litsyn; Alexander Vardy 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 442 KB

Binary codes with specified minimum dist

Binary codes with specified minimum distance

✍ Plotkin, M. 📂 Article 📅 1960 🏛 IEEE 🌐 English ⚖ 700 KB

Three best binary linear block codes of

Three best binary linear block codes of minimum distance fifteen

✍ Farkas, P.; Bruhl, K. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 349 KB

New minimum distance bounds for certain

New minimum distance bounds for certain binary linear codes

✍ Daskalov, R.N.; Kapralov, S.N. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 237 KB

A new upper bound for binary codes with

A new upper bound for binary codes with minimum distance four

✍ Jun Kyo Kim; Sang Geun Hahn 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 134 KB

The purpose of this paper is to give an upper bound for A [n,4], the maximum number of codewords in a binary code of length n with minimum distance d between codewords.

Binary codes with a minimum distance of

Binary codes with a minimum distance of four (Corresp.)

✍ Best, M. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 660 KB