✦ LIBER ✦

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

✍ Scribed by Burshtein, D.; Goldenberg, I.

Book ID: 114642854
Publisher: IEEE
Year: 2011
Tongue: English
Weight: 851 KB
Volume: 57
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2162224

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On low-complexity linear-programming dec

On low-complexity linear-programming decoding of LDPC codes

✍ Vontobel, Pascal O. ;Koetter, Ralf 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

The new minimum distance bounds of Goppa

The new minimum distance bounds of Goppa codes and their decoding

✍ Chang-Seop Park, Gui-Liang Feng, Kenneth K. Tzeng 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 854 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 bounds on the word error probab

Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding

✍ Halabi, N.; Even, G. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 541 KB

On Minimum-WER Performance of a Class of

On Minimum-WER Performance of a Class of LDPC Codes for the BSC/E Under Extended Bounded-Distance Decoding

✍ Amitkumar Mahadevan; Joel M. Morris 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 539 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