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.
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
{"_id":"xrbk3rvgJRLMsjz7X","bibbaseid":"jian-pfister-convergenceofweightedminsumdecodingviadynamicprogrammingontrees-2014","author_short":["Jian, Y.","Pfister, H. D."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-10T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Jian"],"firstnames":["Yung-Yih"],"suffixes":[]},{"propositions":[],"lastnames":["Pfister"],"firstnames":["Henry","D."],"suffixes":[]}],"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","bibtex":"@article{journals/tit/JianP14,\n added-at = {2020-03-10T00:00:00.000+0100},\n author = {Jian, Yung-Yih and Pfister, Henry D.},\n biburl = {https://www.bibsonomy.org/bibtex/240743a3150719a90e810f4e2d3160383/dblp},\n ee = {https://doi.org/10.1109/TIT.2013.2290303},\n interhash = {c84dffd360492241dd513aade12e40e9},\n intrahash = {40743a3150719a90e810f4e2d3160383},\n journal = {IEEE Trans. Inf. Theory},\n keywords = {dblp},\n number = 2,\n pages = {943-963},\n timestamp = {2020-03-11T11:54:08.000+0100},\n title = {Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees.},\n url = {http://dblp.uni-trier.de/db/journals/tit/tit60.html#JianP14},\n volume = 60,\n year = 2014\n}\n\n","author_short":["Jian, Y.","Pfister, H. D."],"key":"journals/tit/JianP14","id":"journals/tit/JianP14","bibbaseid":"jian-pfister-convergenceofweightedminsumdecodingviadynamicprogrammingontrees-2014","role":"author","urls":{"Link":"https://doi.org/10.1109/TIT.2013.2290303","Paper":"http://dblp.uni-trier.de/db/journals/tit/tit60.html#JianP14"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/pfister?items=1000","dataSources":["PGS2HXygFqa56tPwp"],"keywords":["dblp"],"search_terms":["convergence","weighted","min","sum","decoding","via","dynamic","programming","trees","jian","pfister"],"title":"Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees.","year":2014}