✦ LIBER ✦

Distance-spectrum formulas on the largest minimum distance of block codes

✍ Scribed by Po-Ning Chen; Tzong-Yow Lee; Han, Y.S.

Book ID: 114541568
Publisher: IEEE
Year: 2000
Tongue: English
Weight: 570 KB
Volume: 46
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.841167

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum distance of combinatorial

On the minimum distance of combinatorial codes

✍ Tolhuizen, L.; van Lint, J.H. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 162 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

On the minimum distances of Schubert cod

On the minimum distances of Schubert codes

✍ Hao Chen 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 167 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