List Decoding of Universal Polar Codes

Boaz Shuval, Ido Tal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A list decoding scheme for universal polar codes is presented. Our scheme applies to the universal polar codes first introduced by Şaşoǧlu and Wang, and generalized to processes with memory by the authors. These codes are based on the concatenation of different polar transforms: a sequence of slow transforms and Arikan's original fast transform. List decoding of polar codes has been previously presented in the context of the fast transform. However, the slow transform is markedly different and requires new techniques and data structures. We show that list decoding is possible with space complexity O({\mathcal{L}}\cdot N) and time complexity O({\mathcal{L}}\cdot N\log N), where N is the overall blocklength and {\mathcal{L}} is the list size.

Original languageEnglish
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Number of pages6
ISBN (Electronic)9781728164328
StatePublished - Jun 2020
Event2020 IEEE International Symposium on Information Theory, ISIT 2020 - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Publication series

NameIEEE International Symposium on Information Theory - Proceedings


Conference2020 IEEE International Symposium on Information Theory, ISIT 2020
Country/TerritoryUnited States
CityLos Angeles

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics


Dive into the research topics of 'List Decoding of Universal Polar Codes'. Together they form a unique fingerprint.

Cite this