Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 350

The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.

Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access

Open access
Paolini, Enrico, Liva, Gianluigi, Chiani, Marco · 2015 · IEEE Transactions on Information Theory

Abstract

In this paper, a random access scheme is introduced, which relies on the combination of packet erasure correcting codes and successive interference cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph representation of the SIC process, resembling iterative decoding of generalized low-density parity-check codes over the erasure channel, is exploited to optimize the selection probabilities of the component erasure correcting codes through a density evolution analysis. The capacity (in packets per slot) of the scheme is then analyzed in the context of the collision channel without feedback. Moreover, a capacity bound is developed, and component code distributions tightly approaching the bound are derived.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.2015.2492579

Cites

14 of 14 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 14 references

Metadata

Authors
Paolini, E., Liva, G., & Chiani, M.
Venue
IEEE Transactions on Information Theory
Published
2015-12
Volume
61
Issue
12
Pages
6815-6832
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2108659721
Cited by
350
References
14
FWCI
34.92
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 Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access. https://app.cochat.ai/papers/10.1109/tit.2015.2492579
The paper
Paolini, E., Liva, G., & Chiani, M. (2015). Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2015.2492579

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.