✦ LIBER ✦

New minimum distance bounds for certain binary linear codes

✍ Scribed by Daskalov, R.N.; Kapralov, S.N.

Book ID: 114539633
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 237 KB
Volume: 38
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.165453

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Minimum Distance Bounds for Linear C

New Minimum Distance Bounds for Linear Codes overGF(9)

✍ R. Daskalov; E. Metodieva; P. Hristov 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 154 KB

New Minimum Distance Bounds for Linear C

New Minimum Distance Bounds for Linear Codes over Small Fields

✍ R. N. Daskalov; T. A. Gulliver 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 115 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.

Bounds on Minimum Distance for Linear Co

Bounds on Minimum Distance for Linear Codes over GF(5)

✍ Rumen N. Daskalov; T. Aaron Gulliver 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 56 KB

A new lower bound for the minimum distan

A new lower bound for the minimum distance of binary Goppa codes

✍ Feng Guiliang 📂 Article 📅 1985 🏛 SP Science Press 🌐 English ⚖ 278 KB

On minimum distance bounds for abelian c

On minimum distance bounds for abelian codes

✍ Roberta Evans Sabin 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 818 KB