The DOI matches its Crossref record.
On universal quantization by randomized uniform/lattice quantizers
Abstract
Uniform quantization with dither, or lattice quantization with dither in the vector case, followed by a universal lossless source encoder (entropy coder), is a simple procedure for universal coding with distortion of a source that may take continuously many values. The rate of this universal coding scheme is examined, and a general expression is derived for it. An upper bound for the redundancy of this scheme, defined as the difference between its rate and the minimal possible rate, given by the rate distortion function of the source, is derived. This bound holds for all distortion levels. Furthermore, a composite upper bound on the redundancy as a function of the quantizer resolution that leads to a tighter bound in the high rate (low distortion) case is presented.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Self-citationAchieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
Erez, U., & Zamir, R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834787 · Cited by 732
Self-citationCommunication-efficient federated learning
Chen, M., Shlezinger, N., Poor, H. V., Eldar, Y. C., & Cui, S. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2024789118 · Cited by 397
Lattices Which Are Good for (Almost) Everything
Erez, U., Litsyn, S., & Zamir, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855591 · Cited by 365
Self-citationMoulin, P., & Koetter, R. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2005.859599 · Cited by 306
UVeQFed: Universal Vector Quantization for Federated Learning
Shlezinger, N., Chen, M., Eldar, Y. C., Poor, H. V., & Cui, S. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3046971 · Cited by 275
Variable Rate Deep Image Compression With a Conditional Autoencoder
Choi, Y., El-Khamy, M., & Lee, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00324 · Cited by 274
Compressive Sampling and Lossy Compression
Goyal, V. K., Fletcher, A. K., & Rangan, S. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.915001 · Cited by 252
Communication-Efficient and Distributed Learning Over Wireless Networks: Principles and Applications
Park, J., Samarakoon, S., Elgabli, A., Kim, J., Bennis, M., Kim, S.-L., & Debbah, M. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3055679 · Cited by 25
Metadata
- Authors
- Zamir, R., & Feder, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1992-03
- Volume
- 38
- Issue
- 2
- Pages
- 428-436
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2084071523
- Cited by
- 221
- References
- 0
- FWCI
- 2.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.