Quantizing Using Lattice Intersections
<|reference_start|>Quantizing Using Lattice Intersections: The usual quantizer based on an n-dimensional lattice L maps a point x in R^n to a closest lattice point. Suppose L is the intersection of lattices L_1, ..., L_r. Then one may instead combine the information obtained by simultaneously quantizing x with respect to each of the L_i. This corresponds to decomposing R^n into a honeycomb of cells which are the intersections of the Voronoi cells for the L_i, and identifying the cell to which x belongs. This paper shows how to write several standard lattices (the face-centered and body-centered cubic lattices, the root lattices D_4, E_6*, E_8, the Coxeter-Todd, Barnes-Wall and Leech lattices, etc.) in a canonical way as intersections of a small number of simpler, decomposable, lattices. The cells of the honeycombs are given explicitly and the mean squared quantizing error calculated in the cases when the intersection lattice is the face-centered or body-centered cubic lattice or the lattice D_4.<|reference_end|>
@article{sloane2002quantizing,
    title={Quantizing Using Lattice Intersections},
    author={N. J. A. Sloane, B. Beferull-Lozano},
    journal={Discrete and Computational Geometry 25 (2003), 799-824},
    year={2002},
    archivePrefix={arXiv},
    eprint={math/0207147},
    primaryClass={math.CO cs.IT math.IT}
}