Performance and Complexity of Sequential Decoding of PAC Codes
Information Theory
2020-12-18 v2 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2012.04990,
title = {Performance and Complexity of Sequential Decoding of PAC Codes},
author = {Mohsen Moradi and Amir Mozammel and Kangjian Qin and Erdal Arikan},
journal= {arXiv preprint arXiv:2012.04990},
year = {2020}
}