✦ LIBER ✦

Combinatorial analysis of the minimum distance of turbo codes

✍ Scribed by Breiling, M.; Huber, J.B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Minimum Distance of Turbo-Like Codes

✍ Bazzi, L.; Mahdian, M.; Spielman, D.A. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 228 KB

On the minimum distance of combinatorial

✍ Tolhuizen, L.; van Lint, J.H. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 162 KB

Upper bound on the minimum distance of t

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

A logarithmic upper bound on the minimum

✍ Breiling, M. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 573 KB

A new upper bound on the minimum distanc

✍ Perotti, A.; Benedetto, S. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 552 KB

Estimating the minimum distance of turbo

✍ Crozier, S.; Guinand, P.; Hunt, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 372 KB