Upper Bounds for Small Trellis Codes
Publication
, Journal Article
Calderbank, AR; Pottie, GJ
Published in: IEEE Transactions on Information Theory
January 1, 1992
An upper bound on the minimum squared distance of trellis codes by packing Voronoi cells is derived, and we compare this bound with previously known bounds. The bound is tight to search results for coset codes with a small number of states. © 1992 IEEE
Duke Scholars
Published In
IEEE Transactions on Information Theory
DOI
EISSN
1557-9654
ISSN
0018-9448
Publication Date
January 1, 1992
Volume
38
Issue
6
Start / End Page
1791 / 1795
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
Calderbank, A. R., & Pottie, G. J. (1992). Upper Bounds for Small Trellis Codes. IEEE Transactions on Information Theory, 38(6), 1791–1795. https://doi.org/10.1109/18.165452
Calderbank, A. R., and G. J. Pottie. “Upper Bounds for Small Trellis Codes.” IEEE Transactions on Information Theory 38, no. 6 (January 1, 1992): 1791–95. https://doi.org/10.1109/18.165452.
Calderbank AR, Pottie GJ. Upper Bounds for Small Trellis Codes. IEEE Transactions on Information Theory. 1992 Jan 1;38(6):1791–5.
Calderbank, A. R., and G. J. Pottie. “Upper Bounds for Small Trellis Codes.” IEEE Transactions on Information Theory, vol. 38, no. 6, Jan. 1992, pp. 1791–95. Scopus, doi:10.1109/18.165452.
Calderbank AR, Pottie GJ. Upper Bounds for Small Trellis Codes. IEEE Transactions on Information Theory. 1992 Jan 1;38(6):1791–1795.
Published In
IEEE Transactions on Information Theory
DOI
EISSN
1557-9654
ISSN
0018-9448
Publication Date
January 1, 1992
Volume
38
Issue
6
Start / End Page
1791 / 1795
Related Subject Headings
- Networking & Telecommunications
- 1005 Communications Technologies
- 0906 Electrical and Electronic Engineering
- 0801 Artificial Intelligence and Image Processing