Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees. Jian, Y. & Pfister, H. D. IEEE Trans. Inf. Theory, 60(2):943-963, 2014.
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees. [link]Link  Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees. [link]Paper  bibtex   
@article{journals/tit/JianP14,
  added-at = {2020-03-10T00:00:00.000+0100},
  author = {Jian, Yung-Yih and Pfister, Henry D.},
  biburl = {https://www.bibsonomy.org/bibtex/240743a3150719a90e810f4e2d3160383/dblp},
  ee = {https://doi.org/10.1109/TIT.2013.2290303},
  interhash = {c84dffd360492241dd513aade12e40e9},
  intrahash = {40743a3150719a90e810f4e2d3160383},
  journal = {IEEE Trans. Inf. Theory},
  keywords = {dblp},
  number = 2,
  pages = {943-963},
  timestamp = {2020-03-11T11:54:08.000+0100},
  title = {Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit60.html#JianP14},
  volume = 60,
  year = 2014
}

Downloads: 0