LDPC Codes for Information Embedding and Lossy Distributed Source Coding

Inspired by our recent work on lossy distributed source coding with side information available at the decoder, we propose a practical scheme for information embedding system with side information available at the encoder. Our proposed scheme is based on sending parity bits using LDPC codes. We provide a design procedure for the LDPC code that guarantees performance close to the Gelfand-Pinsker and Wyner-Ziv limits. Using simulation results, we show that the proposed method performs close to both Wyner-Ziv and Gelfand-Pinsker theoretical limits for even short length codes.