✦ LIBER ✦

A new lower bound for the minimum distance of a cyclic code

✍ Scribed by Roos, C.

Book ID: 114635274
Publisher: IEEE
Year: 1983
Tongue: English
Weight: 421 KB
Volume: 29
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1983.1056672

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A New Bound for the Minimum Distance of

A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

✍ Betti, E.; Sala, M. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 411 KB

A Bound on the Minimum Distance of Quasi

A Bound on the Minimum Distance of Quasi-cyclic Codes

✍ Güneri̇, Cem; Özbudak, Ferruh 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 231 KB

Decoding Cyclic Codes up to a New Bound

Decoding Cyclic Codes up to a New Bound on the Minimum Distance

✍ Zeh, A.; Wachter-Zeh, A.; Bezzateev, S.V. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 335 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.

A new upper bound on the minimum distanc

A new upper bound on the minimum distance of turbo codes

✍ Perotti, A.; Benedetto, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 552 KB