{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:58Z","timestamp":1772283538799,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181948","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"251-260","source":"Crossref","is-referenced-by-count":21,"title":["Decoding turbo-like codes via linear programming"],"prefix":"10.1109","author":[{"given":"J.","family":"Feldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.R.","family":"Karger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"wicker","year":"1995","journal-title":"Error Control Systems for Digital Communication and Storage"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4469-2"},{"key":"18","article-title":"MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches","author":"wainwright","year":"2002"},{"key":"15","first-page":"27","article-title":"Extremaleigenschaften regularer graphen gegebener taillenweite, iandii","volume":"s bii","author":"sauer","year":"1967","journal-title":"Sitzungsberichte &#x00D6 sterreich Acad Wiss Math Natur Kl"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/18.910578"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"11","author":"macwilliams","year":"1981","journal-title":"The Theory of Error Correcting Codes"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/49.661103"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008114"},{"key":"1","author":"ahuja","year":"1993","journal-title":"Network Flows"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708611"},{"key":"7","first-page":"251","article-title":"Regulare graphen gegebene taillenweite mit minimaler knotenzahl","volume":"12","author":"erdo?s","year":"1963","journal-title":"Wiss Z Univ Hall Martin Luther Univ Halle-Wittenberg Math Natur Reine"},{"key":"6","first-page":"201","article-title":"Coding theorems for 'turbo-like' codes","author":"divsalar","year":"1998","journal-title":"Proc 36th Annual Allerton Conference on Comm Control and Computing"},{"key":"5","article-title":"Upper bound on the minimum distance of turbo codes using a combinatorial approach","author":"breiling","year":"2001"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.37236\/1386","article-title":"Constructions for cubic graphs with large girth","volume":"5","author":"biggs","year":"1998","journal-title":"Electronic Journal of Combinatorics"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(74)90870-5"},{"key":"8","article-title":"Linear programming based decoding of turbo-like codes and its relation to iterative approaches","author":"feldman","year":"0","journal-title":"Proc 40th Annual Allerton Conference on Comm Control and Computing October 2002"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181948.pdf?arnumber=1181948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T04:54:15Z","timestamp":1623128055000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181948\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181948","relation":{},"subject":[]}}