Name
Abstract | ||
|---|---|---|
A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any ε > 0, and total frame length N, the parameters of the scheme can be set such that the frame error probability is less than 2-N 1-ε, while the scheme is still capacity achieving. This improves upon 2-N 0.5-ε, the frame error probability of Arikan's polar codes. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISIT.2013.6620367 | Information Theory Proceedings |
Keywords | DocType | Volume |
Reed-Solomon codes,binary codes,block codes,decoding,binary polar codes,concatenated polar codes,construction,decoding,error-decay rate,interleaved Reed-Solomon codes,interleaved block codes | Journal | abs/1301.7491 |
ISSN | Citations | PageRank |
2157-8095 | 12 | 0.87 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hessam Mahdavifar | 1 | 130 | 14.84 |
| El-Khamy Mostafa | 2 | 264 | 28.10 |
| Jungwon Lee | 3 | 890 | 95.15 |
| Inyup Kang | 4 | 304 | 32.39 |