2000 character limit reached
Performance and Complexity of Sequential Decoding of PAC Codes
Published 9 Dec 2020 in cs.IT and math.IT | (2012.04990v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.