Math @ Duke
|
Publications [#336911] of Vahid Tarokh
Papers Published
- Blake, IF; Tarokh, V, On the trellis complexity of the densest lattice packings in ℝn,
Siam Journal on Discrete Mathematics, vol. 9 no. 4
(January, 1996),
pp. 597-601, Society for Industrial & Applied Mathematics (SIAM) [doi]
(last updated on 2023/06/01)
Abstract: An inequality relating the trellis complexity of lattices to their dimension and Hermite parameter is established. Using this inequality, a conjecture of Forney is proved indicating that the trellis complexity of the densest lattice packings in ℝn grows exponentially as a function of their coding gain.
|
|
dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
| |
Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320
|
|