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