{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:56Z","timestamp":1740131696797,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["61271280","61377011"],"award-info":[{"award-number":["61271280","61377011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002881","name":"University of China","doi-asserted-by":"publisher","award":["NCET-13-0481"],"award-info":[{"award-number":["NCET-13-0481"]}],"id":[{"id":"10.13039\/501100002881","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Provincial Foundation for Youth Nova of Science and Technology of Shaanxi","award":["2014KJXX-41"],"award-info":[{"award-number":["2014KJXX-41"]}]},{"name":"Fundamental Research Fund for the Central Universities of China","award":["2014YQ001","QN2013086"],"award-info":[{"award-number":["2014YQ001","QN2013086"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tcomm.2016.2518680","type":"journal-article","created":{"date-parts":[[2016,1,18]],"date-time":"2016-01-18T21:18:39Z","timestamp":1453151919000},"page":"1232-1245","source":"Crossref","is-referenced-by-count":10,"title":["Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources"],"prefix":"10.1109","volume":"64","author":[{"given":"Yong","family":"Fang","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Stankovic","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"En-hui","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","first-page":"248","article-title":"Construction of LDPC codes using Ramanujan graphs and ideas from Margulis","author":"rosenthal","year":"0","journal-title":"Proc 38th Annu Allerton Conf Commun Comput Control"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579283"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/4234.957380"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.804244"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.080212.110108A"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.111313.130230"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.071172"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2014280"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2007.4379079"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2023359"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5652620"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1007\/BF02997783","article-title":"Hamming distance spectra of turbo-codes","volume":"50","author":"podemski","year":"1995","journal-title":"Ann Telecommun"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/26.554275"},{"key":"ref27","article-title":"Depth-first decoding of distributed arithmetic codes for uniform binary sources","author":"fang","year":"0","journal-title":"IEEE Trans Commun"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3596-6_4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1155\/S1110865704308085"},{"key":"ref29","first-page":"767","article-title":"On the computation of the minimum distance of low-density parity-check codes","volume":"2","author":"hu","year":"0","journal-title":"Proc IEEE Int Conf Commun"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/26.923806"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819307"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2000.859256"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060401"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0198"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2011.6116446"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2030099"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5652684"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.112613.120796"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.012913.120486"},{"journal-title":"Network Information Theory","year":"2012","author":"gamal","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2013.2257944"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/7434088\/7384484.pdf?arnumber=7384484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:14:51Z","timestamp":1654121691000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7384484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2016.2518680","relation":{},"ISSN":["0090-6778"],"issn-type":[{"type":"print","value":"0090-6778"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}