✦ LIBER ✦

Comments on "A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes"

✍ Scribed by Chi-Chao Chao; Mao-Ching Chiu; Schlegel, C.

Book ID: 114540246
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 364 KB
Volume: 41
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.412702

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

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

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

Some lower bounds on the number of code

Some lower bounds on the number of code points in a minimum distance binary code. I

✍ R.P. Bambah; D.D. Joshi; Indar S. Luthar 📂 Article 📅 1961 🏛 Elsevier Science ⚖ 219 KB

Some lower bounds on the number of code

Some lower bounds on the number of code points in a minimum distance binary code. II

✍ R.P. Bambah; D.D. Joshi; Indar S. Luthar 📂 Article 📅 1961 🏛 Elsevier Science ⚖ 133 KB