✦ LIBER ✦

Low-complexity error correction of Hamming-code-based LDPC codes

✍ Scribed by V. A. Zyablov; R. Johannesson; M. Lončar

Book ID: 110179809
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 479 KB
Volume: 45
Category: Article
ISSN: 0032-9460
DOI: 10.1134/s0032946009020021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the error-correcting capability of LD

On the error-correcting capability of LDPC codes

✍ K. Sh. Zigangirov; A. E. Pusane; D. K. Zigangirov; D. J. Costello 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 539 KB

Design of a ternary coding scheme and of

Design of a ternary coding scheme and of single-error-correcting ternary hamming codes

✍ Noriaki Muranaka; Shigeru Imanishi 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 824 KB

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

Asymptotic estimation of the fraction of

Asymptotic estimation of the fraction of errors correctable byq-ary LDPC codes

✍ A. A. Frolov; V. V. Zyablov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 493 KB

A novel lossless data compression scheme

A novel lossless data compression scheme based on the error correcting Hamming codes

✍ Hussein Al-Bahadili 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 553 KB

On the nonexistence of close-packed doub

On the nonexistence of close-packed double Hamming-error-correcting codes on q=7 symbols

✍ Ronald Alter 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 297 KB

The diophantine equation 2y t = 7 k + 1 is shown to have no solutions in integers for k > 2. Since this is a necessary condition for the existence of close-packed double Hamming-error-correcting codes on q = 7 symbols, there exist no such codes.