Polar code (coding theory)
In information theory, a polar code is a linear block error correcting code developed by Erdal Arıkan.[1] It is the first code with an explicit construction to provably achieve the channel capacity for symmetric binary-input, discrete, memoryless channels (B-DMC) with polynomial dependence on the gap to capacity. Notably, polar codes have encoding and decoding complexity 
, which makes them practical for many applications.
See also
- Category:Capacity-achieving codes
- Category:Capacity-approaching codes
References
- ↑ Arikan, E. (July 2009). "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels". IEEE Transactions on Information Theory 55 (7): 3051–73. arXiv:0807.3917v5. doi:10.1109/TIT.2009.2021379.
This article is issued from Wikipedia - version of the Saturday, November 21, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.