Computer Science – Information Theory
Scientific paper
2011-05-31
Computer Science
Information Theory
Scientific paper
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, a straightforward construction is intractable, since the resulting bit channels typically have an output alphabet size which is exponential in the code length. Thus, the core problem that needs to be solved is: how does one faithfully approximate a bit channel with an intractably large output alphabet by another bit channel having a manageable output alphabet size. We devise two approximation methods which "sandwich" the original bit channel. Both approximations turn out to be very close in practice, and can be efficiently computed.
Tal Ido
Vardy Alexander
No associations
LandOfFree
How to Construct Polar Codes 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 How to Construct Polar Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to Construct Polar Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-337673