A Combinatorial Family of Near Regular LDPC Codes

Simple item page
dc.creatorKrishnan, K. Murali
dc.creatorSingh, Rajdeep
dc.creatorChandran, L. Sunil
dc.creatorShankar, Priti
dc.date2006-09-26
dc.date.accessioned2026-07-07T09:18:53Z
dc.date.available2026-07-07T09:18:53Z
dc.descriptionAn elementary combinatorial Tanner graph construction for a family of near-regular low density parity check codes achieving high girth is presented. The construction allows flexibility in the choice of design parameters like rate, average degree, girth and block length of the code and yields an asymptotic family. The complexity of constructing codes in the family grows only quadratically with the block length.
dc.description5 pages 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0609146
dc.identifierhttp://arxiv.org/abs/cs/0609146
dc.identifierISIT 2007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154191
dc.subjectInformation Theory
dc.titleA Combinatorial Family of Near Regular LDPC Codes
dc.typetext

Files

Collections

arXiv