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 accessAbstract
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.
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
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Verdú, S. (1998) · Cited by 4,682
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
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
THE ALOHA SYSTEM - ANOTHER ALTERNATIVE FOR COMPUTER COMMUNICATIONS
Abramson, N. (1970) · doi:10.21236/ad0707853 · Cited by 785
Extrinsic information transfer functions: model and erasure channel properties
Ashikhmin, A., Kramer, G., & ten Brink, S. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.836693 · Cited by 756
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
Self-citationCasini, E., De Gaudenzi, R., & Herrero, O. R. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.348337 · Cited by 696
Zigzag decoding: combating hidden terminals in wireless networks
Gollakota, S., & Katabi, D. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402977 · Cited by 529
(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
Diversity ALOHA--A Random Access Scheme for Satellite Communications
Choudhury, G., & Rappaport, S. (1983) · IEEE Transactions on Communications · doi:10.1109/tcom.1983.1095828 · Cited by 255
ALOHA Random Access that Operates as a Rateless Code
Stefanović, Č., & Popovski, P. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.100913.130232 · Cited by 173
Stable Throughput in a Cognitive Wireless Network
Fanous, A., & Anthony Ephremides, B. (2013) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2013.130317 · Cited by 41
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
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.