Bounds on the Threshold of Linear Programming Decoding

Simple item page
dc.creatorVontobel, Pascal O.
dc.creatorKoetter, Ralf
dc.date2006-02-26
dc.date.accessioned2026-07-07T08:17:57Z
dc.date.available2026-07-07T08:17:57Z
dc.descriptionWhereas many results are known about thresholds for ensembles of low-density parity-check codes under message-passing iterative decoding, this is not the case for linear programming decoding. Towards closing this knowledge gap, this paper presents some bounds on the thresholds of low-density parity-check code ensembles under linear programming decoding.
dc.identifierhttps://arxiv.org/abs/cs/0602087
dc.identifierhttp://arxiv.org/abs/cs/0602087
dc.identifierProc. IEEE Information Theory Workshop (ITW 2006), Punta del Este, Uruguay, March 13-17, 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134269
dc.subjectInformation Theory
dc.titleBounds on the Threshold of Linear Programming Decoding
dc.typetext

Files

Collections

arXiv