Further asymptotic upper bounds on the minimum distance of trellis codes
Publication
, Journal Article
Pottie, GJ; Calderbank, AR
Published in: IEEE Transactions on Information Theory
1993
Asymptotic upper bounds on the minimum distance of trellis codes are derived. A universal bound and bounds specific to PSK and QAM signal sets are obtained.
Duke Scholars
Published In
IEEE Transactions on Information Theory
DOI
Publication Date
1993
Volume
39
Issue
4
Start / End Page
1428 / 1434
Related Subject Headings
- Networking & Telecommunications
- 1005 Communications Technologies
- 0906 Electrical and Electronic Engineering
- 0801 Artificial Intelligence and Image Processing
Citation
APA
Chicago
ICMJE
MLA
NLM
Pottie, G. J., & Calderbank, A. R. (1993). Further asymptotic upper bounds on the minimum distance of trellis codes. IEEE Transactions on Information Theory, 39(4), 1428–1434. https://doi.org/10.1109/18.243464
Pottie, G. J., and A. R. Calderbank. “Further asymptotic upper bounds on the minimum distance of trellis codes.” IEEE Transactions on Information Theory 39, no. 4 (1993): 1428–34. https://doi.org/10.1109/18.243464.
Pottie GJ, Calderbank AR. Further asymptotic upper bounds on the minimum distance of trellis codes. IEEE Transactions on Information Theory. 1993;39(4):1428–34.
Pottie, G. J., and A. R. Calderbank. “Further asymptotic upper bounds on the minimum distance of trellis codes.” IEEE Transactions on Information Theory, vol. 39, no. 4, 1993, pp. 1428–34. Scival, doi:10.1109/18.243464.
Pottie GJ, Calderbank AR. Further asymptotic upper bounds on the minimum distance of trellis codes. IEEE Transactions on Information Theory. 1993;39(4):1428–1434.
Published In
IEEE Transactions on Information Theory
DOI
Publication Date
1993
Volume
39
Issue
4
Start / End Page
1428 / 1434
Related Subject Headings
- Networking & Telecommunications
- 1005 Communications Technologies
- 0906 Electrical and Electronic Engineering
- 0801 Artificial Intelligence and Image Processing