Efficient LDPC codes over GF(q) for lossy data compression

@article{Braunstein2009EfficientLC,
  title={Efficient LDPC codes over GF(q) for lossy data compression},
  author={Alfredo Braunstein and Farbod Kayhan and Riccardo Zecchina},
  journal={2009 IEEE International Symposium on Information Theory},
  year={2009},
  pages={1978-1982}
}
In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultra-sparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(≪ d ≫ .n.q. log2 q), where ≪ d ≫ is the average degree of the check nodes. For our… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Similar Papers

Loading similar papers…