On the Non-Approximate Successive Cancellation Decoding of Binary Polar Codes With Medium Kernels
Polar codes constructed by large kernels can attain better finite length performance than those originating from Arıkan’s <inline-formula> <tex-math notation="LaTeX">$2\times 2$ </tex-math></inline-formula> kernel. However, the successive cance...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10214576/ |