On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)

DOI10.3934/amc.2017007zbMath1357.94081arXiv1502.06871OpenAlexW2588432628MaRDI QIDQ514531

Alexey Frolov, Victor Zyablov

Publication date: 9 March 2017

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.06871

zbMATH Keywords

coding theoryLDPC codesdecoding radiusiterative decodingmajority logic decodingthreshold decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Cites Work

• Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
• On the error-correcting capability of LDPC codes
• Low-complexity error correction of Hamming-code-based LDPC codes
• Ramanujan graphs
• Eigenvalues and expanders
• Expander codes
• On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm
• A recursive approach to low complexity codes
• On the Number of Errors Correctable with Codes on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)