Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes

Simple item page
dc.creatorMitchell, David G. M.
dc.creatorPusane, Ali E.
dc.creatorGoertz, Norbert
dc.creatorCostello Jr, Daniel J.
dc.date2008-04-28
dc.date.accessioned2026-07-07T09:35:39Z
dc.date.available2026-07-07T09:35:39Z
dc.descriptionIn 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.
dc.description6 pages, 4 figures, 1 table
dc.identifierhttps://arxiv.org/abs/0804.4466
dc.identifierhttp://arxiv.org/abs/0804.4466
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159902
dc.subjectInformation Theory
dc.titleFree Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
dc.typetext

Files

Collections

arXiv