✦ LIBER ✦

On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $

✍ Scribed by Blake, Ian F.; Tarokh, Vahid

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Inequality on the Coding Gain of Dens

✍ Amir H. Banihashemi; Amir K. Khandani 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 68 KB

On lattices of convex sets in({mathbb{R}

✍ George M. Bergman 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 371 KB

A remark on an upper bound on the Hermit

✍ B. F. Skubenko 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 78 KB

On the Exponential Dichotomy on(mathbb{R

✍ A. M. Samoilenko 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 168 KB

Complexity of asymptotic behavior of the

✍ Jingxue Yin; Liangwei Wang; Rui Huang 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 303 KB

On the trellis complexity of root lattic

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