✦ LIBER ✦

Bounds on the trellis size of linear block codes

✍ Scribed by Berger, Y.; Be'ery, Y.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the trellis complexity of certain bin

✍ Ytrehus, O. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 514 KB

Low-complexity trellis decoding of linea

✍ Honary, B.; Markarian, G.; Darnell, M. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 617 KB

BCJR trellis construction for binary lin

✍ Manoukian, H.H.; Honary, B. 📂 Article 📅 1997 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 532 KB

Bounds on the minimum distance of trelli

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

MAP algorithms for decoding linear block

✍ Ye Liu; Shu Lin; Fossorier, M.P.C. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 322 KB

Asymptotic Upper Bounds on the Minimum D

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