The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
A perspective on massive random-access
Abstract
This paper discusses the contemporary problem of providing multiple-access (MAC) to a massive number of uncoordinated users. First, we define a random-access code for Ka-user Gaussian MAC to be a collection of norm-constrained vectors such that the noisy sum of any Kaof them can be decoded with a given (suitably defined) probability of error. An achievability bound for such codes is proposed and compared against popular practical solutions: ALOHA, coded slotted ALOHA, CDMA, and treating interference as noise. It is found out that as the number of users increases existing solutions become vastly energy-inefficient. Second, we discuss the asymptotic (in blocklength) problem of coding for a K-user Gaussian MAC when K is proportional to blocklength and each user's payload is fixed. It is discovered that the energy-per-bit vs. spectral efficiency exhibits a rather curious tradeoff in this case.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Verdú, S. (1998) · Cited by 4,682
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Self-citationEl Gamal, A., & Kim, Y.-H. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139030687 · Cited by 2,716
Cdma: Principles of Spread Spectrum Communication
Viterbi, A. J. (1995) · Medical Entomology and Zoology · Cited by 2,656
THE ALOHA SYSTEM: another alternative for computer communications
Abramson, N. (1970) · Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall) · doi:10.1145/1478462.1478502 · Cited by 2,029
Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA
Liva, G. (2010) · IEEE Transactions on Communications · doi:10.1109/tcomm.2010.120710.100054 · Cited by 749
Casini, E., De Gaudenzi, R., & Herrero, O. R. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.348337 · Cited by 696
Multi-way communication channels
Ahlswede, R. (1973) · PUB – Publications at Bielefeld University (Bielefeld University) · Cited by 615
A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
Tanaka, T. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.804053 · Cited by 562
Randomly Spread CDMA: Asymptotics Via Statistical Physics
Guo, D., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847700 · Cited by 399
Cited by
Massive Access for 5G and Beyond
Chen, X., Ng, D. W. K., Yu, W., Larsson, E. G., Al-Dhahir, N., & Schober, R. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3019724 · Cited by 681
Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G
Vaezi, M., Azari, A., Khosravirad, S. R., Shirvanimoghaddam, M., Azari, M. M., Chasaki, D., & Popovski, P. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3151028 · Cited by 631
Grant-Free Non-Orthogonal Multiple Access for IoT: A Survey
Shahab, M. B., Abbas, R., Shirvanimoghaddam, M., & Johnson, S. J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2996032 · Cited by 453
Ke, M., Gao, Z., Wu, Y., Gao, X., & Schober, R. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2967175 · Cited by 417
Massive Access for Future Wireless Communication Systems
Wu, Y., Gao, X., Zhou, S., Yang, W., Polyanskiy, Y., & Caire, G. (2020) · IEEE Wireless Communications · doi:10.1109/mwc.001.1900494 · Cited by 241
Self-citation
Metadata
- Authors
- Polyanskiy, Y.
- Venue
- 2017 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 2523-2527
- OpenAlex
- W2742359230
- Cited by
- 490
- References
- 15
- FWCI
- 40.47
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A perspective on massive random-access. https://app.cochat.ai/papers/10.1109/isit.2017.8006984
- The paper
- Polyanskiy, Y. (2017). A perspective on massive random-access. 2017 IEEE International Symposium on Information Theory (ISIT). https://doi.org/10.1109/isit.2017.8006984
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.