Distance properties of expander codes

Simple item page
dc.creatorBarg, Alexander
dc.creatorZemor, Gilles
dc.date2004-09-07
dc.date.accessioned2026-07-07T08:15:14Z
dc.date.available2026-07-07T08:15:14Z
dc.descriptionWe study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall code is asymptotically good, and sometimes meets the Gilbert-Varshamov bound. Constructive families of expander codes are presented whose minimum distance asymptotically exceeds the product bound for all code rates between 0 and 1.
dc.description19 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/cs/0409010
dc.identifierhttp://arxiv.org/abs/cs/0409010
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133386
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.titleDistance properties of expander codes
dc.typetext

Files

Collections

arXiv