The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Lattices Which Are Good for (Almost) Everything
Abstract
We define an ensemble of lattices, and show that for asymptotically high dimension most of its members are simultaneously good as sphere packings, sphere coverings, additive white Gaussian noise (AWGN) channel codes and mean-squared error (MSE) quantization codes. These lattices are generated by applying Construction A to a random linear code over a prime field of growing size, i.e., by "lifting" the code to /spl Ropf//sup n/.
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
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
An Introduction To The Theory Of Numbers
Hardy, G. H., & Wright, E. M. (2008) · doi:10.1093/oso/9780199219858.001.0001 · Cited by 2,624
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
Pless, V. S., Brualdi, R. A., & Huffman, W. C. (2011) · Medical Entomology and Zoology · Cited by 1,229
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
Rate distortion theory : a mathematical basis for data compression
Berger, T. (1971) · Prentice Hall eBooks · Cited by 953
Rate Distortion Theory: A Mathematical Basis for Data Compression
Davisson, L. (1972) · IEEE Transactions on Communications · doi:10.1109/tcom.1972.1091311 · Cited by 895
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-citationAsymptotically optimal block quantization
Gersho, A. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056067 · Cited by 863
Probability of Error for Optimal Codes in a Gaussian Channel
Shannon, C. E. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb03905.x · Cited by 807
Achieving<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-citationBerger, T. (2003) · Wiley Encyclopedia of Telecommunications · doi:10.1002/0471219282.eot142 · Cited by 717
An introduction to the theory of numbers
Hardy, G. H. (1929) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1929-04793-1 · Cited by 603
Asymptotic quantization error of continuous signals and the quantization dimension
Zador, P. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056490 · Cited by 530
A Comparison of Signalling Alphabets
Gilbert, E. N. (1952) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1952.tb01393.x · Cited by 522
Gray, R. M. (2011) · Entropy and Information Theory · doi:10.1007/978-1-4419-7970-4_14 · Cited by 392
Zamir, R., & Feder, M. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.508838 · Cited by 333
Self-citationRandom codes: minimum distances and error exponents
Barg, A., & Forney, G. D. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800480 · Cited by 248
On universal quantization by randomized uniform/lattice quantizers
Zamir, R., & Feder, M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119699 · Cited by 221
Self-citationZiv, J. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057034 · Cited by 177
On the asymptotic tightness of the Shannon lower bound
Linder, T., & Zamir, R. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340474 · Cited by 121
Self-citationLattice codes can achieve capacity on the AWGN channel
Urbanke, R. L., & Rimoldi, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651040 · Cited by 119
Rogers, C. A. (1959) · Mathematika · doi:10.1112/s002557930000190x · Cited by 70
Coding for a discrete information source with a distortion measure
Goblick, T. J. (1963) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 68
Asymptotic Optimality of Group and Systematic Codes for Some Channels
Dobrushin, R. L. (1963) · Theory of Probability and Its Applications · doi:10.1137/1108003 · Cited by 61
Cited by
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Achieving<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-citationInformation Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
Metadata
- Authors
- Erez, U., Litsyn, S., & Zamir, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-10
- Volume
- 51
- Issue
- 10
- Pages
- 3401-3416
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2122621581
- Cited by
- 365
- References
- 32
- FWCI
- 14.77
- 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.