Successive-Cancellation Decoding of Linear Source Code
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 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.
Keywords
Cite
@article{arxiv.1903.11787,
title = {Successive-Cancellation Decoding of Linear Source Code},
author = {Jun Muramatsu},
journal= {arXiv preprint arXiv:1903.11787},
year = {2019}
}
Comments
(v1) 8 pages (v2) 8 pages, Eq.(12) is modified (v3) 8 pages, typos (especially in Lemma 1) are fixed, (v4) 8 pages, a typo in Eq.(12) is fixed, submitted to ITW2019