The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Sphere Packings, Lattices and Groups
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
On the Diagonalization of Quadratic Forms
Lam, T. Y. (1999) · Mathematics Magazine · doi:10.1080/0025570x.1999.11996736 · Cited by 8
A Characterization of the Leech Lattice
Conway, J. H. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7_12 · Cited by 3
Self-citation
Cited by
Achieving near-capacity on a multiple-antenna channel
Hochwald, B. M., & ten Brink, S. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.809789 · Cited by 2,033
Gray, R. M., & Neuhoff, D. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720541 · Cited by 1,642
Minimax and maximin distance designs
Johnson, M. E., Moore, L. M., & Ylvisaker, D. (1990) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(90)90122-b · Cited by 1,451
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
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
Capacity Trends and Limits of Optical Communication Networks
Essiambre, R.-J., & Tkach, R. W. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2182970 · Cited by 712
Modulation and coding for linear Gaussian channels
Forney, G. D., & Ungerboeck, G. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720542 · Cited by 597
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Optimal nonuniform signaling for Gaussian channels
Kschischang, F. R., & Pasupathy, S. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256499 · Cited by 503
Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
L'Ecuyer, P. (1999) · Operations Research · doi:10.1287/opre.47.1.159 · Cited by 460
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
Goyal, V. K., Vetterli, M., & Thao, N. T. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650985 · Cited by 417
Channel coding: The road to channel capacity
Costello, D. J., & Forney, G. D. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.895188 · Cited by 408
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
Scalar costa scheme for information embedding
Eggers, J. J., Bauml, R., Tzschoppe, R., & Girod, B. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.809366 · Cited by 357
A new upper bound on the minimal distance of self-dual codes
Conway, J. H., & Sloane, N. J. A. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59931 · Cited by 347
Self-citationVoronoi–dirichlet polyhedra in crystal chemistry: theory and applications
Blatov *, V. A. (2004) · Crystallography Reviews · doi:10.1080/08893110412331323170 · Cited by 332
Bayesian approaches to Gaussian mixture modeling
Roberts, S. J., Husmeier, D., Rezek, I., & Penny, W. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.730550 · Cited by 317
A close-to-capacity dirty paper coding scheme
Erez, U., & ten Brink, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855586 · Cited by 307
Locality sensitive hashing: A comparison of hash function types and querying mechanisms
Paulevé, L., Jégou, H., & Amsaleg, L. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.04.004 · Cited by 297
Excitation structure of the hierarchy scheme in the fractional quantum Hall effect
Read, N. (1990) · Physical Review Letters · doi:10.1103/physrevlett.65.1502 · Cited by 286
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
Data dimensionality estimation methods: a survey
Camastra, F. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00176-6 · Cited by 271
The Nonlinear Statistics of High-Contrast Patches in Natural Images
Lee, A. B., Pedersen, K. S., & Mumford, D. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023705401078 · Cited by 234
High-Dimensional Stochastic Gradient Quantization for Communication-Efficient Edge Learning
Du, Y., Yang, S., & Huang, K. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2983166 · Cited by 116
Natural selection: a phase transition?
Eigen, M. (2000) · Biophysical Chemistry · doi:10.1016/s0301-4622(00)00122-8 · Cited by 86
The cusped hyperbolic orbifolds of minimal volume in dimensions less than ten
Hild, T. (2007) · Journal of Algebra · doi:10.1016/j.jalgebra.2006.12.024 · Cited by 18
Metadata
- Authors
- Conway, J. H., & Sloane, N. J. A.
- Venue
- Grundlehren der mathematischen Wissenschaften
- Publisher
- Springer New York
- Published
- 1988
- ISSN
- 0072-7830 (ISSN-L)
- OpenAlex
- W4293259454
- Cited by
- 1,532
- References
- 2
- FWCI
- 21.39
- Type
- book
- Language
- de
- 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.