{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:27:43Z","timestamp":1725467263888},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6034108","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"2904-2908","source":"Crossref","is-referenced-by-count":5,"title":["New techniques for upper-bounding the MLD performance of binary linear codes"],"prefix":"10.1109","author":[{"given":"Xiao","family":"Ma","sequence":"first","affiliation":[]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Baoming","family":"Bai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1993.748383"},{"key":"ref3","article-title":"Evaluation of the block error probability of block modulation codes by the maximum-likelihood decoding for an AWGN channel","author":"kasami","year":"1992","journal-title":"Proceedings Symposium on Information Theory and its applications"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892807"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.335935"},{"key":"ref11","article-title":"New techniques for upper-bounding the ML decoding performance of binary linear codes","author":"ma","year":"2011","journal-title":"Submitted to IEEE Trans Inform Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.335901"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.820746"},{"key":"ref7","article-title":"A simple tight bound on error probability of block codes with application to turbo codes","author":"divsalar","year":"1999","journal-title":"Proc 1999 IEEE Communication Theory Workshop"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11696"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613857"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000009"}],"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\/06034108.pdf?arnumber=6034108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T02:52:57Z","timestamp":1490064777000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6034108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6034108","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}