Performance and Complexity of Sequential Decoding of PAC Codes
arXiv:2012.04990
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.
References in corpus (1)
Cited by in corpus (4)
- Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes
- Successive Cancellation Decoding with Future Constraints for Polar Codes Over the Binary Erasure Channel
- On the Metric and Computation of PAC Codes
- Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm