Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protograph-based LDPC convolutional codes. In particular, we show that the free distance to constraint length ratio of the regular LDPC convolutional codes exceeds that of the minimum distance to block length ratio of the corresponding LDPC block codes.
6 pages, 4 figures, 1 table

Keywords

Information Theory

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.4466
 http://arxiv.org/abs/0804.4466

Collections

arXiv