✦ LIBER ✦

Construction of linear codes with large minimum distance

✍ Scribed by Braun, M.

Book ID: 114638369
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 172 KB
Volume: 50
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2004.831742

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal -nary linear codes with large mi

Maximal -nary linear codes with large minimum distance (Corresp.)

✍ Patel, A. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 785 KB

Construction of some binary linear codes

Construction of some binary linear codes of minimum distance five

✍ Chen, C.L. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 416 KB

Quasi-Perfect Linear Codes With Minimum

Quasi-Perfect Linear Codes With Minimum Distance

✍ Giulietti, M.; Pasticci, F. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 429 KB

Concatenated codes with large minimum di

Concatenated codes with large minimum distance (Corresp.)

✍ Lih-Jyh Weng 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 464 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

Performance of low-density parity-check

Performance of low-density parity-check codes with linear minimum distance

✍ Pishro-Nik, H.; Fekri, F. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 344 KB