On the multiple threshold decoding of LDPC codes over GF(q)

DOI10.3934/AMC.2017007zbMATH Open1357.94081arXiv1502.06871OpenAlexW2588432628MaRDI QIDQ514531FDOQ514531

Alexey Frolov, V. V. Zyablov

Publication date: 9 March 2017

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

Abstract: We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new algorithm is derived. The estimate is shown to be better than the estimate for a single threshold majority decoder. At the same time the transition to multiple thresholds does not affect the order of complexity.

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

Recommendations

• LDPC Codes Over the $q$ -ary Multi-Bit Channel
• Iterative Decoding Threshold Analysis for LDPC Convolutional Codes
• Generalized threshold decoding of convolutional codes
• Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$
• Multitrial decoding of concatenated codes using fixed thresholds
• Algorithm of multithreshold decoding for Gaussian channels
• Iterative Decoding of LDPC Codes Over the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Partial Erasure Channel
• An Efficient Layered Decoding Architecture for Nonbinary QC-LDPC Codes
• On the Encoding Complexity of Quasi-Cyclic LDPC Codes
• Threshold Decoding

zbMATH Keywords

coding theoryLDPC codesdecoding radiusiterative decodingmajority logic decodingthreshold decoding

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Algorithm of multithreshold decoding for Gaussian channels
• LDPC Codes Over the $q$ -ary Multi-Bit Channel
• Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514531)