{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:24Z","timestamp":1752192084124,"version":"3.41.2"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1967,7,1]],"date-time":"1967-07-01T00:00:00Z","timestamp":-79056000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1967,7]]},"DOI":"10.1109\/tit.1967.1054041","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"356-359","source":"Crossref","is-referenced-by-count":5,"title":["Asymptotic performance and complexity of a coding scheme for memoryless channels"],"prefix":"10.1109","volume":"13","author":[{"given":"J.","family":"Ziv","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TIT.1963.1057827","article-title":"A Heuristic discussion of probabilistic decoding","volume":"it 9","author":"fano","year":"1963","journal-title":"IEEE Trans Information Theory"},{"journal-title":"Sequential Decoding","year":"1961","author":"wozencraft","key":"ref3"},{"journal-title":"Lectures on Communication System Theory","year":"1961","author":"elias","key":"ref10"},{"journal-title":"Threshold Decoding","year":"1964","author":"massey","key":"ref6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057464"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057586"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053878"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057824"},{"journal-title":"Low Density Parity Check Codes","year":"1964","author":"gallager","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref9","first-page":"56","article-title":"Algebraic decoding for a binary erasure channel","author":"epstein","year":"1955","journal-title":"IRE Conv Record"},{"key":"ref1","first-page":"324","author":"fano","year":"0","journal-title":"Transmission of Information"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22635\/01054041.pdf?arnumber=1054041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:09Z","timestamp":1752103029000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1054041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,7]]},"references-count":12,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1967.1054041","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1967,7]]}}}