A Combinatorial Family of Near Regular LDPC Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

An 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.
5 pages 3 figures

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/154191

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609146
 http://arxiv.org/abs/cs/0609146
 ISIT 2007

Collections

arXiv