Gaussian source coding with spherical codes

DOI10.1109/TIT.2002.804056MaRDI QIDQ4677618zbMATH OpenFDO

Authors Jon Hamkins, Kenneth Zeger

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.804056

Mathematics Subject Classification ID

Source coding (94A29) 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)

Recommendations

• A shape-gain approach for vector quantization based on flat tori
• Lattice vector quantization of generalized Gaussian sources
• Analytical coding of Gaussian sources
• Multidimensional companding quantization of the gaussian source
• scientific article; zbMATH DE number 46194

Cited in

(11)

• A heuristic approach for designing cyclic group codes
• Decoding spherical codes for the Gaussian channel
• An algorithm for maximising covered area
• A geometric treatment of the source encoding of a Gaussian random variable
• Iteratively maximum likelihood decodable spherical codes and a method for their construction
• Vector Gaussian Two-Terminal Source Coding
• Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error
• Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source
• Geometric piecewise uniform lattice vector quantization of the memoryless Gaussian source
• On the statistics of matching pursuit angles
• A shape-gain approach for vector quantization based on flat tori

This page was built for publication: Gaussian source coding with spherical codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677618)