Abstract
Improved upper bounds on the blocklength required to communicate over binary-input channels using polar codes, below some given error probability, are derived. For that purpose, an improved bound on the number of non-polarizing channels is obtained. The main result is that the blocklength required to communicate reliably scales at most as (O((I(W)-R-5.702})) , where (R) is the code rate and (I(W)) is the symmetric capacity of the channel (W). The results are then extended to polar lossy source coding at rate (R) of a source with symmetric distortion-rate function (Dc)). The blocklength required scales at most as (O((D0-5.702})) , where (D0) is the maximal allowed gap between the actual average (or typical) distortion and (D(R)).
| Original language | English |
|---|---|
| Article number | 6905834 |
| Pages (from-to) | 6966-6978 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 60 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2014 |
Keywords
- Channel polarization
- gap to capacity
- polar codes
- rate-distortion.
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Fingerprint
Dive into the research topics of 'Improved bounds on the finite length scaling of polar codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver