Chained Successive Cancellation Decoding of the Extended Golay code
classification
💻 cs.IT
math.IT
keywords
algorithmcancellationchainedcodedecodingextendedgolaysuccessive
read the original abstract
The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.