Reducing the Error Floor
| dc.creator | Chertkov, Michael | |
| dc.date | 2007-06-20 | |
| dc.date.accessioned | 2026-07-07T08:16:09Z | |
| dc.date.available | 2026-07-07T08:16:09Z | |
| dc.description | We discuss how the loop calculus approach of [Chertkov, Chernyak '06], enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06] and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding of graph based codes in the error-floor domain. The utility of the new, Linear Programming based, decoding is demonstrated via analysis and simulations of the model $[155,64,20]$ code. | |
| dc.description | 6 pages, 1 figure, invited talk at ITW'07 Tahoe | |
| dc.identifier | https://arxiv.org/abs/0706.2926 | |
| dc.identifier | http://arxiv.org/abs/0706.2926 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133682 | |
| dc.subject | Information Theory | |
| dc.title | Reducing the Error Floor | |
| dc.type | text |