Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information. Wainwright, M. J. & Martinian, E. IEEE Trans. Information Theory, 55(3):1061-1079, 2009.
Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information. [link]Link  Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information. [link]Paper  bibtex   
@article{journals/tit/WainwrightM09,
  added-at = {2018-11-02T00:00:00.000+0100},
  author = {Wainwright, Martin J. and Martinian, Emin},
  biburl = {https://www.bibsonomy.org/bibtex/207b95d97be41c698b52a20ffa222acc1/dblp},
  ee = {https://doi.org/10.1109/TIT.2008.2009815},
  interhash = {053209d131c2f2f19e69fc6bbe87a763},
  intrahash = {07b95d97be41c698b52a20ffa222acc1},
  journal = {IEEE Trans. Information Theory},
  keywords = {dblp},
  number = 3,
  pages = {1061-1079},
  timestamp = {2018-11-03T12:05:05.000+0100},
  title = {Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit55.html#WainwrightM09},
  volume = 55,
  year = 2009
}

Downloads: 0