Abstract:
Polar coding theorems state that as the number of channel use, n, tends to infinity, the fraction of un-polarized bit-channels (the bit-channels whose Z parameters are in...Show MoreMetadata
Abstract:
Polar coding theorems state that as the number of channel use, n, tends to infinity, the fraction of un-polarized bit-channels (the bit-channels whose Z parameters are in the interval (δ(n), 1- δ (n)), tends to zero. Consider two BEC channels W(z1) and W(z2). Motivated by polar coding scheme proposed for the wiretap channel, we investigate the number of bit-channels which are simultaneously un-polarized for both of W(z1) and W(z2). We show that for finite values of n, there is a considerable regime of (z1, Z2) where the set of (joint)un-polarized bit-channels is empty. We also show that for γ ≤ 1/2 and δ (n) = 2-nγ, the number of un-polarized bit-channels is lower bounded by 2γ log (n).
Date of Conference: 11-14 May 2014
Date Added to IEEE Xplore: 23 October 2014
ISBN Information: