Multilevel expander codes

Simple item page
dc.creatorBarg, Alexander
dc.creatorZemor, Gilles
dc.date2005-02-19
dc.date.accessioned2026-07-07T08:17:45Z
dc.date.available2026-07-07T08:17:45Z
dc.descriptionWe define multilevel codes on bipartite graphs that have properties analogous to multilevel serial concatenations. A decoding algorithm is described that corrects a proportion of errors equal to half the Blokh-Zyablov bound on the minimum distance. The error probability of this algorithm has exponent similar to that of serially concatenated multilevel codes.
dc.identifierhttps://arxiv.org/abs/cs/0502079
dc.identifierhttp://arxiv.org/abs/cs/0502079
dc.identifier"Algebraic Coding Theory and Information Theory," Providence, RI: AMS (2005), pp. 69-83.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134201
dc.subjectInformation Theory
dc.titleMultilevel expander codes
dc.typetext

Files

Collections

arXiv