Successive-Cancellation Decoding of Linear Source Code

2019/03/28 by Muramatsu, Jun
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1903.11787

Abstract

This paper investigates the error probability of several decoding methods for a source code with decoder side information, where the decoding methods are: 1) symbol-wise maximum a posteriori decoding, 2) successive-cancellation decoding, and 3) stochastic successive-cancellation decoding. The proof of the effectiveness of a decoding method is reduced to that for an arbitrary decoding method, where `effective' means that the error probability goes to zero as n goes to infinity. Furthermore, we revisit the polar source code showing that stochastic successive-cancellation decoding, as well as successive-cancellation decoding, is effective for this code.

Related

• Polar Codes: Robustness of the Successive Cancellation Decoder with Respect to Quantization
• Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization
• Successive Cancellation Decoding of Polar Codes using Stochastic Computing
• Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm
• An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design