Min-Max decoding for non binary LDPC codes
| dc.creator | Savin, Valentin | |
| dc.date | 2008-03-07 | |
| dc.date | 2009-01-13 | |
| dc.date.accessioned | 2026-07-07T12:28:11Z | |
| dc.date.available | 2026-07-07T12:28:11Z | |
| dc.description | Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decoding non-binary codes. The Min-Max algorithm is one of them and it has the benefit of two possible LLR domain implementations: a standard implementation, whose complexity scales as the square of the Galois field's cardinality and a reduced complexity implementation called selective implementation, which makes the Min-Max decoding very attractive for practical purposes. | |
| dc.description | 5 pages, ISIT08 version v2: acknowledgement footnote, and appendix containing proofs of some statements in the paper | |
| dc.identifier | https://arxiv.org/abs/0803.1094 | |
| dc.identifier | http://arxiv.org/abs/0803.1094 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/215456 | |
| dc.subject | Information Theory | |
| dc.title | Min-Max decoding for non binary LDPC codes | |
| dc.type | text |