Abstract
Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric.
| Original language | English |
|---|---|
| Article number | 6399602 |
| Pages (from-to) | 1505-1516 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 59 |
| Issue number | 3 |
| DOIs | |
| State | Published - 2013 |
Keywords
- Capacity-achieving codes
- maximum distance separable (MDS) codes
- parallel channels
- polar codes
- stochastically degraded channels
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences