Fast quantizing and decoding and algorithms for lattice quantizers and codes

DOI10.1109/TIT.1982.1056484MaRDI QIDQ3962919zbMATH OpenDBLPWikidataFDO

Authors N. J. A. Sloane, J. H. Conway

Publication date 1982

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

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

zbMATH Keywords

codes for a Gaussian channelmaximum likelihood decodingminimum distortion lattice pointvector quantizing of uniformly distributed datavery fast algorithm for finding the closest lattice point to an arbitrary point

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Communication, information (94A99) Decoding (94B35)

Cited in

(15)

• Quantizers ad the worst case Euclidean traveling salesman problem
• Matrix product constraints by projection methods
• The closest vector problem in tensored root lattices of type A and in their duals
• 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
• Random coding bound for the second moment of multidimensional lattices
• Design of efficient codes for the AWGN channel based on decomposable binary lattices
• The Optimal Lattice Quantizer in Three Dimensions
• A Note on Lattice Packings via Lattice Refinements
• On Gaussian sampling, smoothing parameter and application to signatures
• Lattice codes for CRYSTALS-Kyber
• Compact lattice-coded (multi-recipient) Kyber without CLT independence assumption
• Lattice quantization error for redundant representations
• A new multistage lattice vector quantization with adaptive subband thresholding for image compression

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)