LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel
Adam Cohen, Fady Alajaji, Navin Kashyap, Glen K. Takahara · IEEE Communications Letters · 2008
Linear programming (LP) decoding of low-density parity-check codes over discrete memoryless symmetric channels was introduced by Feldman et al. in [1]. Here, we extend the LP decoding paradigm by applying it to two additional scenarios: joint source-channel (JSC) coding and decoding over the infinitememory non-ergodic binary Polya-contagion channel. Simulation results indicate that the JSC LP decoder yields significant gains over the standard LP decoder for non-uniform sources. Simulations also show that the LP decoder for the Polya channel performs moderately well in relation to the ϵ-capacity limit.