Name
Abstract | ||
|---|---|---|
A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show that this scheme is capacity-achieving, i.e. its information rate is as good as the best code specifically designed for the unknown channel. Previous rateless coding schemes are designed for specific classes of channels such as AWGN channels, binary erasure channels, etc. but the proposed rateless coding scheme is capacity-achieving for broad classes of channels as long as they are ordered via degradation. Moreover, it inherits the conceptual and computational simplicity of polar codes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ISIT.2016.7541258 | 2016 IEEE International Symposium on Information Theory (ISIT) |
Keywords | Field | DocType |
capacity-achieving rateless polar codes,unknown channel,receiver information bit decoding reliability,computational simplicity | Online codes,Mathematical optimization,Code rate,Algorithm,Communication channel,Coding (social sciences),Theoretical computer science,Polar,Additive white Gaussian noise,Mathematics,Erasure,Binary number | Journal |
Volume | ISBN | Citations |
abs/1508.03112 | 978-1-5090-1807-9 | 0 |
PageRank | References | Authors |
0.34 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Li | 1 | 134 | 11.32 |
| David N. C. Tse | 2 | 2078 | 246.17 |
| Kai Chen | 3 | 59 | 14.81 |
| Hui Shen | 4 | 51 | 4.72 |