{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:19:05Z","timestamp":1729631945011,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5706908","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T16:50:52Z","timestamp":1296751852000},"page":"201-207","source":"Crossref","is-referenced-by-count":13,"title":["Coding with a latency constraint: The benefits of sequential decoding"],"prefix":"10.1109","author":[{"given":"Shashank V.","family":"Maiya","sequence":"first","affiliation":[]},{"given":"Daniel J.","family":"Costello","sequence":"additional","affiliation":[]},{"given":"Thomas E.","family":"Fuja","sequence":"additional","affiliation":[]},{"given":"Wai","family":"Fong","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"A Comparison of Decoding Latency for Block and Convolutional Codes","author":"kaiser","year":"2009","journal-title":"ISCTA 2009"},{"journal-title":"Encyclopedia of Sparse Graph Codes","year":"0","author":"mackay","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/26.46505"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/26.61470"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.340456"},{"journal-title":"LdbpOpt – a fast and accurate degree distribution optimizer for LDPC ensembles","year":"0","author":"urbanke","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1147\/rd.136.0675"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03905.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITNW.1999.814339"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839541"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.06.080014"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","article-title":"Optimal decoding of linear codes for minimizing symbol error rate","volume":"20","author":"bahl","year":"1974","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"ref2","article-title":"Code performance as a function of blocksize","author":"dolinar","year":"1998","journal-title":"JPL TDA Progress Report"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","first-page":"13","article-title":"Some sequential decoding procedures","volume":"2","author":"zigangirov","year":"1966","journal-title":"Probl Peredachi Inf"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05706908.pdf?arnumber=5706908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T15:22:15Z","timestamp":1497885735000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5706908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5706908","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}