Gaussian source coding with spherical codes
From MaRDI portal
Publication:4677618
DOI10.1109/TIT.2002.804056zbMath1062.94017MaRDI QIDQ4677618
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Relations with coding theory (11H71) Source coding (94A29)
Related Items (5)
A shape-gain approach for vector quantization based on flat tori ⋮ On the statistics of matching pursuit angles ⋮ An algorithm for maximising covered area ⋮ Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source ⋮ A heuristic approach for designing cyclic group codes
This page was built for publication: Gaussian source coding with spherical codes
