New lattice codes for multiple-descriptions

A new coding scheme for the L-descriptions problem is proposed. In particular we consider continuous sources and lattice quantizers. New covering and packing bounds for using nested lattices are derived. We prove through an example that using nested lattice quantizers instead of independently generated codebooks results in gains.