The polynomial error probability for LDPC codes

Simple item page
dc.creatorvan Mourik, J.
dc.creatorKabashima, Y.
dc.date2003-10-08
dc.date.accessioned2026-07-07T02:54:04Z
dc.date.available2026-07-07T02:54:04Z
dc.descriptionWe obtain exact expressions for the asymptotic behaviour of the average probability of the block decoding error for ensembles of regular low density parity check error correcting codes, by employing diagrammatic techniques. Furthermore, we show how imposing simple constraints on the code ensemble (that can be practically implemented in linear time), allows one to suppress the error probability for codes with more than 2 checks per bit, to an arbitrarily low power of $N$. As such we provide a practical route to a (sub-optimal){\em expurgated} ensemble.
dc.description15 pages 13 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0310177
dc.identifierhttp://arxiv.org/abs/cond-mat/0310177
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/22397
dc.subjectStatistical Mechanics
dc.subjectDisordered Systems and Neural Networks
dc.titleThe polynomial error probability for LDPC codes
dc.typetext

Files

Collections

arXiv