Binary Polar Code Kernels from Code Decompositions
Information Theory
2011-07-05 v3 math.IT
Abstract
Code decompositions (a.k.a code nestings) are used to design good binary polar code kernels. The proposed kernels are in general non-linear and show a better rate of polarization under successive cancelation decoding, than the ones suggested by Korada et al., for the same kernel dimensions. In particular, kernels of sizes 14, 15 and 16 are constructed and shown to provide polarization rates better than any binary kernel of such sizes.
Keywords
Cite
@article{arxiv.1101.0764,
title = {Binary Polar Code Kernels from Code Decompositions},
author = {Noam Presman and Ofer Shapira and Simon Litsyn},
journal= {arXiv preprint arXiv:1101.0764},
year = {2011}
}