Pith. sign in

REVIEW

Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.06495 v1 pith:SJP5ZOAX submitted 2022-07-13 cs.IT math.IT

Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting

Enrico Paolini , Lorenzo Valentini , Velio Tralli , Marco Chiani This is my paper
classification cs.IT math.IT
keywords irsaalohaapproachchannelinformation-theoreticirregularquantitiesrepetition
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

An information-theoretic approach to irregular repetition slotted ALOHA (IRSA) is proposed. In contrast with previous works, in which IRSA analysis is conducted only based on quantities that are typical of collision models such as the traffic, the new approach also captures more fundamental quantities. Specifically, a suitable codebook construction for the adder channel model is adopted to establish a link with successive interference cancellation over the multi-packet reception channel. This perspective allows proving achievability and converse results for the average sum rate of IRSA multiple access schemes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.