Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding
Information Theory
2016-04-14 v1 math.IT
Abstract
Polar codes are considered the latest major breakthrough in coding theory. Polar codes were introduced by Ar{\i}kan in 2008. In this letter, we show that the binary polar codes are the same as the optimized codes for bitwise multistage decoding (OCBM), which have been discovered before by Stolte in 2002. The equivalence between the techniques used for the constructions and decodings of both codes is established.
Keywords
Cite
@article{arxiv.1604.03612,
title = {Binary Polar Codes are Optimized Codes for Bitwise Multistage Decoding},
author = {Mostafa El-Khamy and Hsien-Ping Lin and Jungwon Lee},
journal= {arXiv preprint arXiv:1604.03612},
year = {2016}
}
Comments
Accepted at Electronics Letters