A fast encoding method for lattice codes and quantizers
From MaRDI portal
Recommendations
Cited in
(15)- Penny-packing and two-dimensional codes
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
- Low-complexity indexing method for Z^n and D_n lattice quantizers
- On the optimality of finite constellations from algebraic lattices
- Theory of lattice-based fine-coarse vector quantization
- Near-ellipsoidal voronoi coding
- Encoding and Decoding Binary Product Lattices
- Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design
- Finding the closest lattice point by iterative slicing
- CAVLC coding algorithm and FPGA realization of high-speed entropy encoder
- Optimization of lattices for quantization
- scientific article; zbMATH DE number 1456828 (Why is no real title available?)
- A fast BER evaluation method for LDGM codes
- On Gaussian sampling, smoothing parameter and application to signatures
- Lattice quantization error for redundant representations
This page was built for publication: A fast encoding method for lattice codes and quantizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342457)