A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Posterior matching variants and fixed-point elimination
2009
2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
The posterior matching scheme is known to achieve capacity for a large class of memoryless channels with noiseless feedback. In this contribution, it is shown that whenever the posterior matching kernel admits a fixed point, the corresponding scheme is not ergodic and cannot achieve any positive rate. The source of the problem is traced back to the input ordering implicit in the definition of the scheme. It is then shown how for any discrete memoryless channel, a simple (and easily computable)
doi:10.1109/allerton.2009.5394893
fatcat:eepaivujjzhtxhoxnu55iq5ayu