✦ LIBER ✦

Minimum distance bounding techniques for individual trellis codes

✍ Scribed by Porath, J.-E.

Book ID: 117861266
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 360 KB
Volume: 43
Category: Article
ISSN: 0090-6778
DOI: 10.1109/26.380092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Asymptotic Upper Bounds on the Minimum D

Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes

✍ Calderbank, A.; Mazo, J.; Wei, V. 📂 Article 📅 1985 🏛 IEEE 🌐 English ⚖ 504 KB

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

Minimum Distance Bounds fors-Regular Cod

Minimum Distance Bounds fors-Regular Codes

✍ William J. Martin 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 47 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

On minimum distance bounds for abelian c

On minimum distance bounds for abelian codes

✍ Roberta Evans Sabin 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 818 KB