Fast quantizing and decoding and algorithms for lattice quantizers and codes
DOI10.1109/TIT.1982.1056484zbMATH Open0497.94013DBLPjournals/tit/ConwayS82aWikidataQ56049951 ScholiaQ56049951MaRDI QIDQ3962919FDOQ3962919
Authors: N. J. A. Sloane, J. H. Conway 
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
Combinatorial aspects of packing and covering (05B40) Communication, information (94A99) Decoding (94B35)
Cited In (13)
- On the Voronoi Regions of Certain Lattices
- A new multistage lattice vector quantization with adaptive subband thresholding for image compression
- Random coding bound for the second moment of multidimensional lattices
- Quantizers ad the worst case Euclidean traveling salesman problem
- The Optimal Lattice Quantizer in Three Dimensions
- On Gaussian sampling, smoothing parameter and application to signatures
- Design of efficient codes for the AWGN channel based on decomposable binary lattices
- Linear codes interpolation from noisy patterns by means of a vector quantization process
- Lattice quantization error for redundant representations
- Matrix product constraints by projection methods
- The Coxeter–Todd lattice, the Mitchell group, and related sphere packings
- The closest vector problem in tensored root lattices of type A and in their duals
- A Note on Lattice Packings via Lattice Refinements
This page was built for publication: Fast quantizing and decoding and algorithms for lattice quantizers and codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962919)
