Xiaojun Yuan, Li Ping
Abstract
We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives.
OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives.
Key concepts: Binary erasure channel, Online codes, Decoding methods, Erasure, Computer science, Tornado code, Luby transform code, Fountain code