{"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":1775120124324,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1109\/tit.2010.2060030","type":"journal-article","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T21:13:01Z","timestamp":1284585181000},"page":"4905-4921","source":"Crossref","is-referenced-by-count":25,"title":["Interior Point Decoding for Linear Vector Channels Based on Convex Optimization"],"prefix":"10.1109","volume":"56","author":[{"given":"Tadashi","family":"Wadayama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.915712"},{"key":"ref33","article-title":"Towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Proc 4th Int Symp Turbo Codes and Related Topics"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2008.4601085"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797586"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.910595"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205741"},{"key":"ref35","article-title":"Interior point decoding for linear vector channels based on convex optimization","author":"wadayama","year":"2008","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref34","first-page":"2523","article-title":"a coded modulation scheme based on low density parity check codes","volume":"e84 a","author":"wadayama","year":"2001","journal-title":"IEICE Trans Fund"},{"key":"ref10","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref12","author":"fukushima","year":"2004","journal-title":"Hisenkei saitekika no Kiso (in Japanese Basics on Non-linear Optimization)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/26.990894"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055718"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.823434"},{"key":"ref17","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes and Related Topics"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267050"},{"key":"ref19","author":"kojima","year":"2001","journal-title":"Naitenhou (in Japanese Interior Point Method)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557178"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref27","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref3","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4234.1001666"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262071"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595237"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460060506"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262070"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872985"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613311"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003830"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838104"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814494"},{"key":"ref24","author":"papadimitriou","year":"1998","journal-title":"Combinatorial Optimization Algorithm and Complexity"},{"key":"ref23","author":"mackay","year":"0","journal-title":"Encyclopedia of Sparse Graph Codes"},{"key":"ref26","author":"roos","year":"2006","journal-title":"Interior Point Methods for Linear Optimization"},{"key":"ref25","author":"press","year":"1992","journal-title":"Numerical Recipes in C The Art of Scientific Computing"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5571829\/05571870.pdf?arnumber=5571870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T06:04:50Z","timestamp":1640239490000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5571870\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2060030","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}