80 search results - page 9 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
ICASSP
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we study non-binary regular LDPC cycle codes whose parity check matrix has fixed column weight 2 and fixed row weight d. We prove that the parity check matrix of ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We consider source coding with fixed lag side information at the decoder. We focus on the special case of perfect side information with unit lag corresponding to source coding wit...
80
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
AAECC
2006
Springer
15 years 1 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
73
Voted
TIT
2002
14 years 9 months ago
2002
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...