80 search results - page 1 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
ISITA
2010
13 years 4 months ago
2010
In this paper syndrome former trellis construction for punctured convolutional codes (PCCs) is discussed. The class of (np - 1)/np-rate PCCs derived from 1/n-rate mother codes is c...
TIT
2008
13 years 7 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract—In this paper, we investigate the performancecomplexity trade-off for two leading-edge channel coding techniques, namely Duo-Binary Turbo-Codes (DBTC) and Block LDPC Cod...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...