{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T08:55:24Z","timestamp":1775120124041,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1109\/allerton.2008.4797586","type":"proceedings-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T15:05:03Z","timestamp":1236611103000},"page":"402-409","source":"Crossref","is-referenced-by-count":10,"title":["Efficient implementation of linear programming decoding"],"prefix":"10.1109","author":[{"given":"Mohammad H.","family":"Taghavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Shokrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul H.","family":"Siegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","article-title":"the art of computer programming","volume":"3","author":"knuth","year":"1998","journal-title":"Sorting and Searching"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1126\/science.132.3436.1306-a"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"11","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557442"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262071"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"10","article-title":"efficient interior-point implementation of linear programming decoding","author":"taghavi","year":"0","journal-title":"Submitted to IEEE Trans Inform Theory"},{"key":"7","article-title":"towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Proc Int'l Conf on Turbo Codes and Related Topics"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601085"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557412"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"8","article-title":"graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","author":"vontobel","year":"0","journal-title":"Sumbitted to IEEE Trans Inform Theory"}],"event":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","location":"Monticello, IL, USA","start":{"date-parts":[[2008,9,23]]},"end":{"date-parts":[[2008,9,26]]}},"container-title":["2008 46th Annual Allerton Conference on Communication, Control, and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4786970\/4797526\/04797586.pdf?arnumber=4797586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T23:19:58Z","timestamp":1489792798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4797586\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2008.4797586","relation":{},"subject":[],"published":{"date-parts":[[2008,9]]}}}