On the Block Error Probability of LP Decoding of LDPC Codes

Simple item page
dc.creatorKoetter, Ralf
dc.creatorVontobel, Pascal O.
dc.date2006-02-26
dc.date.accessioned2026-07-07T08:17:57Z
dc.date.available2026-07-07T08:17:57Z
dc.descriptionIn his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular low-density parity-check codes.
dc.identifierhttps://arxiv.org/abs/cs/0602086
dc.identifierhttp://arxiv.org/abs/cs/0602086
dc.identifierProc. Inaugural Workshop of the Center for Information Theory and its Applications, UC San Diego, San Diego, CA, USA, Feb. 6-10, 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134268
dc.subjectInformation Theory
dc.titleOn the Block Error Probability of LP Decoding of LDPC Codes
dc.typetext

Files

Collections

arXiv