✦ LIBER ✦

Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes

✍ Scribed by Calderbank, A.; Mazo, J.; Wei, V.

Book ID: 117912782
Publisher: IEEE
Year: 1985
Tongue: English
Weight: 504 KB
Volume: 33
Category: Article
ISSN: 0090-6778
DOI: 10.1109/tcom.1985.1096299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further asymptotic upper bounds on the m

Further asymptotic upper bounds on the minimum distance of trellis codes

✍ Pottie, G.J.; Calderbank, A.R. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 431 KB

Bounds on the minimum distance of trelli

Bounds on the minimum distance of trellis codes

✍ Burnashev, M.; Biglieri, E.M. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 399 KB

Upper bounds on the minimum distance of

Upper bounds on the minimum distance of spherical codes

✍ Boyvalenkov, P.G.; Danev, D.P.; Bumova, S.P. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 591 KB

A note on upper bounds for minimum dista

A note on upper bounds for minimum distance codes

✍ D.D. Joshi 📂 Article 📅 1958 🏛 Elsevier Science ⚖ 216 KB

Upper bound on the minimum distance of t

Upper bound on the minimum distance of turbo codes

✍ Breiling, M.; Huber, J.B. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 196 KB

Bounds on the Minimum Distance of High D

Bounds on the Minimum Distance of High Dimensional Circular Trellis-Coded Modulation

✍ Xiangyu Song; Jeffrey Dill; Alan R. Lindsey 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis