61 research outputs found
Chained Successive Cancellation Decoding of the Extended Golay code
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
Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search
A novel construction of polar codes with dynamic frozen symbols is proposed.
The proposed codes are subcodes of extended BCH codes, which ensure
sufficiently high minimum distance. Furthermore, a decoding algorithm is
proposed, which employs estimates of the not-yet-processed bit channel error
probabilities to perform directed search in code tree, reducing thus the total
number of iterations.Comment: Accepted to ITW201
- …