most citedDe-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code

34 citations · 34 across the 1 of their papers we have counts for

collaborators

1 paper

cs.IT2012★ 34 cited

De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code

Hari Balakrishnan, Peter Iannucci, Jonathan Perry +1

This paper presents an analysis of spinal codes, a class of rateless codes proposed recently. We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (…