{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:49:30Z","timestamp":1730274570776,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034129","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2999-3003","source":"Crossref","is-referenced-by-count":4,"title":["Linear programming based detectors for two-dimensional intersymbol interference channels"],"prefix":"10.1109","author":[{"given":"Shrinivas","family":"Kudekar","sequence":"first","affiliation":[]},{"given":"Jason K.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Misha","family":"Chertkov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Two-dimensional viterbi-like algorithms","year":"1998","author":"krishnamoorthi","key":"ref10"},{"article-title":"Full-surface data storage","year":"2000","author":"weeks","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2007.897665"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2003.814291"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2002.801894"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523563"},{"key":"ref16","first-page":"2354","article-title":"On the achievable information rates of nite-state input two-dimensional channels with memory","author":"shental","year":"2005","journal-title":"Proc of the IEEE Int Symposium on Inform Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405304"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006384"},{"key":"ref4","article-title":"Towards efficient detection of two-dimensional inter symbol interference channels","volume":"e91","author":"kurkoski","year":"2008","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ODS.2006.1632753"},{"key":"ref6","article-title":"On the computation complexity of 2d maximum-likelihood sequence detection","author":"ordentlich","year":"2006","journal-title":"technical Report HPL2006–69"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054829"},{"key":"ref8","first-page":"891","article-title":"Detection of 2-dimensional signals in the presence of isi and noise","author":"marrow","year":"2003","journal-title":"Proc International Symposium on Information Theory and its Applications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2003.1216712"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2003.1258962"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1699-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1364\/ODS.2003.TuB1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2023735"},{"article-title":"Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches","year":"2008","author":"johnson","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592887"},{"key":"ref24","article-title":"New outer bounds on the marginal polytope","author":"sontag","year":"2007","journal-title":"Neural Information Processing Systems (NIPS)"},{"key":"ref23","article-title":"Lagrangian relaxation for map estimation in graphical models","author":"johnson","year":"2007","journal-title":"Proc of the Allerton Conf on Commun Control and Computing"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06034129.pdf?arnumber=6034129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:09:11Z","timestamp":1490054951000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034129","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}