✦ LIBER ✦

Upper bounds on trellis complexity of lattices

✍ Scribed by Tarokh, V.; Vardy, A.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Trellis complexity and minimal trellis d

✍ Banihashemi, A.H.; Blake, I.F. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 842 KB

On the trellis complexity of root lattic

✍ Banihashemi, A.H.; Blake, I.F. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 211 KB

Asymptotic Upper Bounds on the Minimum D

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

New upper bounds on the linear complexit

✍ P. Caballero-Gil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Further asymptotic upper bounds on the m

✍ Pottie, G.J.; Calderbank, A.R. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 431 KB

Algorithms for Sat and Upper Bounds on T

✍ M. A. Vsemirnov; E. A. Hirsch; E. Ya. Dantsin; S. V. Ivanov 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 264 KB