{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:38Z","timestamp":1740131678770,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2014]]},"DOI":"10.1109\/tcomm.2014.2378257","type":"journal-article","created":{"date-parts":[[2014,12,6]],"date-time":"2014-12-06T00:23:13Z","timestamp":1417825393000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory"],"prefix":"10.1109","author":[{"given":"Ghady","family":"Azar","sequence":"first","affiliation":[]},{"given":"Fady","family":"Alajaji","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.904502"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2009.2014957"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.45284"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2388191"},{"key":"ref15","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 Comput Sci"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.04.070114"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080713"},{"journal-title":"On the optimality of the hamming metric for decoding block codes over binary additive noise channels","year":"2013","author":"azar","key":"ref18"},{"key":"ref19","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 Comput Sci"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCAS.2004.1286985"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.926683"},{"key":"ref6","first-page":"94","article-title":"Memory increases transmission capacity","volume":"5","author":"dobrushin","year":"1969","journal-title":"Problemy Peredachi Inf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/25.917864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.340476"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.901184"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref2"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref9"},{"journal-title":"Error Control Systems for Digital Communication and Storage","year":"1995","author":"wicker","key":"ref1"},{"key":"ref20","first-page":"375","article-title":"On nongroup close-packed codes","volume":"8","author":"vasil'ev","year":"1962","journal-title":"Probl Kibernetiki"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055578"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2009.5270297"},{"journal-title":"Syndrome Source Coding for Lossless Data Compression Based on Linear Block Codes","year":"2008","author":"wu","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2002.1000008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055171"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7010064\/06977930.pdf?arnumber=6977930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:44Z","timestamp":1642003484000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6977930\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2014.2378257","relation":{},"ISSN":["0090-6778"],"issn-type":[{"type":"print","value":"0090-6778"}],"subject":[],"published":{"date-parts":[[2014]]}}}