Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Good concatenated code ensembles for the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
The minimum distance of turbo-like codes
IEEE Transactions on Information Theory
Stopping set analysis of repeat multiple-accumulate codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Spectra and minimum distances of repeat multiple-accumulate codes
IEEE Transactions on Information Theory
Double serially concatenated convolutional codes with jointly designed S-type permutors
IEEE Transactions on Information Theory
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Hi-index | 755.08 |
Until the analysis of repeat accumulate codes by Divsalar et al. (1998), few people would have guessed that simple rate-1 codes could play a crucial role in the construction of "good" binary codes. We construct "good" binary linear block codes at any rate r