✦ LIBER ✦

Trellis Complexity of Short Linear Codes

✍ Scribed by Bocharova, I. E.; Johannesson, R.; Kudryashov, B. D.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-complexity trellis decoding of linea

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

On the trellis complexity of certain bin

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

The trellis complexity of convolutional

✍ McEliece, R.J.; Wei Lin, 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 935 KB

Trellis-oriented decomposition and trell

✍ Berger, Y.; Be'ery, Y. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 792 KB

Asymptotically good codes have infinite

✍ Lafourcade, A.; Vardy, A. 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 898 KB

Variable-complexity trellis decoding of

✍ Matolak, D.W.; Wilson, S.G. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 719 KB