"Upper and Lower Bounds on the Computational Complexity of Polar Encoding ..."

Christopher G. Blake, Frank R. Kschischang (2019)

> Home

Details and statistics

DOI: 10.1109/TIT.2019.2917683

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/BlakeK19a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/BlakeK19a
Christopher G. Blake, Frank R. Kschischang:
Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding. IEEE Trans. Inf. Theory 65(9): 5656-5673 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.