Fast quantizing and decoding and algorithms for lattice quantizers and codes
From MaRDI portal
Publication:3962919
DOI10.1109/TIT.1982.1056484zbMath0497.94013WikidataQ56049951 ScholiaQ56049951MaRDI QIDQ3962919
Conway, John H., N. J. A. Sloane
Publication date: 1982
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
maximum likelihood decoding; codes for a Gaussian channel; minimum distortion lattice point; vector quantizing of uniformly distributed data; very fast algorithm for finding the closest lattice point to an arbitrary point
94A99: Communication, information
94B35: Decoding
05B40: Combinatorial aspects of packing and covering
Related Items
Design of efficient codes for the AWGN channel based on decomposable binary lattices, The Optimal Lattice Quantizer in Three Dimensions, Random coding bound for the second moment of multidimensional lattices, Lattice quantization error for redundant representations, A new multistage lattice vector quantization with adaptive subband thresholding for image compression, Quantizers ad the worst case Euclidean traveling salesman problem, Linear codes interpolation from noisy patterns by means of a vector quantization process, On the Voronoi Regions of Certain Lattices, The Coxeter–Todd lattice, the Mitchell group, and related sphere packings
