article · IEEE Transactions on Information Theory · 2004
Further Results on Convolutional Code Search for Block-Fading Channels
Marco Chiani, Andrea Conti, Velio Tralli
Cited by 33Abstract and details only
Abstract
This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.
Cite this paper
Chiani, M., Conti, A., & Tralli, V. (2004). Further Results on Convolutional Code Search for Block-Fading Channels. IEEE Transactions on Information Theory, 50(6), 1312–1318. https://doi.org/10.1109/tit.2004.828146
Chiani, Marco, et al. “Further Results on Convolutional Code Search for Block-Fading Channels.” IEEE Transactions on Information Theory, vol. 50, no. 6, 2004, pp. 1312–18, https://doi.org/10.1109/tit.2004.828146.
Chiani, Marco, Andrea Conti, and Velio Tralli. 2004. “Further Results on Convolutional Code Search for Block-Fading Channels.” IEEE Transactions on Information Theory 50 (6): 1312–18. https://doi.org/10.1109/tit.2004.828146.
Chiani, M., Conti, A. and Tralli, V. (2004) ‘Further Results on Convolutional Code Search for Block-Fading Channels’, IEEE Transactions on Information Theory, 50(6), pp. 1312–1318. Available at: https://doi.org/10.1109/tit.2004.828146.
@article{chiani2004further,
title = {{Further Results on Convolutional Code Search for Block-Fading Channels}},
author = {Chiani, Marco and Conti, Andrea and Tralli, Velio},
journal = {IEEE Transactions on Information Theory},
volume = {50},
number = {6},
pages = {1312--1318},
year = {2004},
doi = {10.1109/tit.2004.828146}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.