Optimized codes for the binary coded side-information problem

This paper analyzes a practical scheme for the binary coded side-information problem based on LDPC codes and trellis quantization. A recently proposed improved decoder is shown to be amenable to numerical density evolution and thus to LDPC code optimization. First results display significant gains compared to off-the-shelf codes, which could be further improved by refined modeling of the system.