An inequality on the coding gain of densest lattice packings in successive dimensions
From MaRDI portal
Publication:1265227
DOI10.1023/A:1008288001941zbMath0924.52008OpenAlexW1575971429MaRDI QIDQ1265227
Amir H. Banihashemi, Amir K. Khandani
Publication date: 16 April 1999
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008288001941
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
This page was built for publication: An inequality on the coding gain of densest lattice packings in successive dimensions