Computer Science – Information Theory
Scientific paper
2009-01-05
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, minor updates
Scientific paper
Polar codes were recently introduced by Ar\i kan. They achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely related to the recursive construction of Reed-Muller codes and is based on the $2 \times 2$ matrix $\bigl[ 1 &0 1& 1 \bigr]$. It was shown by Ar\i kan and Telatar that this construction achieves an error exponent of $\frac12$, i.e., that for sufficiently large blocklengths the error probability decays exponentially in the square root of the length. It was already mentioned by Ar\i kan that in principle larger matrices can be used to construct polar codes. A fundamental question then is to see whether there exist matrices with exponent exceeding $\frac12$. We first show that any $\ell \times \ell$ matrix none of whose column permutations is upper triangular polarizes symmetric channels. We then characterize the exponent of a given square matrix and derive upper and lower bounds on achievable exponents. Using these bounds we show that there are no matrices of size less than 15 with exponents exceeding $\frac12$. Further, we give a general construction based on BCH codes which for large $n$ achieves exponents arbitrarily close to 1 and which exceeds $\frac12$ for size 16.
Korada Satish Babu
Sasoglu Eren
Urbanke Rudiger
No associations
LandOfFree
Polar Codes: Characterization of Exponent, Bounds, and Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Polar Codes: Characterization of Exponent, Bounds, and Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polar Codes: Characterization of Exponent, Bounds, and Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35239