✦ LIBER ✦

On the minimum distance of combinatorial codes

✍ Scribed by Tolhuizen, L.; van Lint, J.H.

Book ID: 114540513
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 162 KB
Volume: 36
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.53759

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combinatorial analysis of the minimum di

Combinatorial analysis of the minimum distance of turbo codes

✍ Breiling, M.; Huber, J.B. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 519 KB

On the minimum distance of array codes a

On the minimum distance of array codes as LDPC codes

✍ Kyeongcheol Yang; Helleseth, T. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 249 KB

More on the minimum distance of cyclic c

More on the minimum distance of cyclic codes

✍ de Rooij, P.J.N.; van Lint, J.H. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 383 KB

Bounds on the minimum distance of trelli

Bounds on the minimum distance of trellis codes

✍ Burnashev, M.; Biglieri, E.M. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 399 KB

On computing the minimum distance of lin

On computing the minimum distance of linear codes

✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

Bounds on the Minimum Distance of Goppa

Bounds on the Minimum Distance of Goppa Codes

✍ Maharaj, H. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 209 KB