✦ LIBER ✦

On the complexity of minimum distance decoding of long linear codes

✍ Scribed by Barg, A.; Krouk, E.; van Tilborg, H.C.A.

Book ID: 114541282
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 315 KB
Volume: 45
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.771141

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On decoding of maximum-distance separabl

On decoding of maximum-distance separable linear codes

✍ Stephen Yau; Yu-Cheng Liu 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 774 KB

Bounded minimum distance decoding of uni

Bounded minimum distance decoding of unit memory codes

✍ Dettmar, U.; Serger, U.K. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 973 KB

Generalized minimum distance iterative d

Generalized minimum distance iterative decoding of Tanner codes

✍ Saejoon Kim 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 149 KB

An asymptotic Hamming bound on the feedb

An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)

✍ Aaltonen, M. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 322 KB

Improved Linear Programming Decoding of

Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance

✍ Burshtein, D.; Goldenberg, I. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 851 KB