Performance and Complexity of Sequential Decoding of PAC Codes

9 Dec 2020  ·  Mohsen Moradi, Amir Mozammel, Kangjian Qin, Erdal Arikan ·

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Categories

Information Theory Information Theory

Datasets

  Add Datasets introduced or used in this paper
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy