The DOI matches its Crossref record.
Coded random access: applying codes on graphs to design random access protocols
Open accessAbstract
The rise of machine-to-machine communications has rekindled interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered as waste. However, if the common receiver (e.g. base station) is able to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on a graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded random access protocols are described, as well as a case study on how to upgrade a legacy ALOHA system using the ideas of coded random access.
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
Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2844952 · Cited by 510
Self-citationWireless Access in Ultra-Reliable Low-Latency Communication (URLLC)
Popovski, P., Stefanovic, C., Nielsen, J. J., de Carvalho, E., Angjelichinoski, M., Trillingsgaard, K. F., & Bana, A.-S. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2914652 · Cited by 475
Self-citationTowards Massive Connectivity Support for Scalable mMTC Communications in 5G Networks
Bockelmann, C., Pratas, N. K., Wunder, G., Saur, S., Navarro, M., Gregoratti, D., Vivier, G., De Carvalho, E., Ji, Y., Stefanovic, C., et al. (2018) · IEEE Access · doi:10.1109/access.2018.2837382 · Cited by 289
“tage protocols by allowing more than one packet transmission per radio resource block and resolving collisions through advanced receivers. The solution falls under the category of coded random access [36], where features of channel coding are exploited both at the slot and frame level. In particular, the scheme partia…”
BackgroundMethodInfluentialSelf-citation
Metadata
- Authors
- Paolini, E., Stefanovic, C., Liva, G., & Popovski, P.
- Venue
- IEEE Communications Magazine
- Published
- 2015-06
- Volume
- 53
- Issue
- 6
- Pages
- 144-150
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W2126026248
- Cited by
- 231
- References
- 0
- FWCI
- 13.79
- Type
- journal article
- Language
- en
- Open access
- green
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: Coded random access: applying codes on graphs to design random access protocols. https://app.cochat.ai/papers/10.1109/mcom.2015.7120031
- The paper
- Paolini, E., Stefanovic, C., Liva, G., & Popovski, P. (2015). Coded random access: applying codes on graphs to design random access protocols. IEEE Communications Magazine. https://doi.org/10.1109/mcom.2015.7120031
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.