Pith. sign in

REVIEW

Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound

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 1201.1835 v1 pith:JHQVEGRH submitted 2012-01-09 cs.IT math.IT

Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound

Enrico Paolini , Gianluigi Liva , Marco Chiani This is my paper
classification cs.IT math.IT
keywords boundschemeaccesscapacitychannelcollisioncollisionsfeedback
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for resolving collisions. The proposed protocol achieves reliable communication in the asymptotic setting and attains capacities close to 1 [packets/slot]. A capacity bound as a function of the overall rate of the scheme is derived, and code distributions tightly approaching the bound developed.

discussion (0)

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