Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding

Christopher G. Blake, Frank R. Kschischang. Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding. IEEE Transactions on Information Theory, 65(9):5656-5673, 2019. [doi]

@article{BlakeK19a,
  title = {Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding},
  author = {Christopher G. Blake and Frank R. Kschischang},
  year = {2019},
  doi = {10.1109/TIT.2019.2917683},
  url = {https://doi.org/10.1109/TIT.2019.2917683},
  researchr = {https://researchr.org/publication/BlakeK19a},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Information Theory},
  volume = {65},
  number = {9},
  pages = {5656-5673},
}