{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:45:23Z","timestamp":1730213123466,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/cwit.2013.6621584","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:58:51Z","timestamp":1381546731000},"page":"12-16","source":"Crossref","is-referenced-by-count":0,"title":["When are maximum likelihood and minimum distance decoding equivalent for binary contagion channels?"],"prefix":"10.1109","author":[{"given":"Ghady","family":"Azar","sequence":"first","affiliation":[]},{"given":"Fady","family":"Alajaji","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.847161"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/18.45284"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080713"},{"key":"14","first-page":"1870","article-title":"A sufficient condition for a code to achieve the minimum decoding error probability-generalization of perfect and quasi-perfect codes","volume":"e83 a","author":"hamada","year":"2000","journal-title":"IEICE Trans Fundam Electron Commun Comp Sci"},{"key":"11","first-page":"2383","article-title":"Near-optimality of subcodes of hamming codes on the two-state Markovian additive channel","volume":"e84 a","author":"hamada","year":"2001","journal-title":"IEICE Trans Fundam Electron Commun Comp Sci"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.04.070114"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100604"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048456"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.340476"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936109"},{"key":"7","first-page":"187","article-title":"Decoding LDPC codes over binary channels with additive Markov noise","author":"nicola","year":"2005","journal-title":"Proceedings of CWIT'05"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.050912.110261"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.904502"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901184"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.836568"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856934"}],"event":{"name":"2013 13th Canadian Workshop on Information Theory (CWIT)","start":{"date-parts":[[2013,6,18]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2013,6,21]]}},"container-title":["2013 13th Canadian Workshop on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6603431\/6621577\/06621584.pdf?arnumber=6621584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T16:52:48Z","timestamp":1490201568000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6621584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/cwit.2013.6621584","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}