{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:46:50Z","timestamp":1761947210901,"version":"3.41.2"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1967,4,1]],"date-time":"1967-04-01T00:00:00Z","timestamp":-86918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1967,4,1]],"date-time":"1967-04-01T00:00:00Z","timestamp":-86918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1967,4,1]],"date-time":"1967-04-01T00:00:00Z","timestamp":-86918400000},"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,4]]},"DOI":"10.1109\/tit.1967.1053977","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"167-174","source":"Crossref","is-referenced-by-count":96,"title":["A lower bound to the distribution of computation for sequential decoding"],"prefix":"10.1109","volume":"13","author":[{"given":"I.","family":"Jacobs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Berlekamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053875"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"journal-title":"Principles of Communication Engineering","year":"1965","author":"wozencraft","key":"ref12"},{"year":"1965","author":"yudkin","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1965.1089090"},{"key":"ref4","first-page":"174","author":"falconer","year":"1966","journal-title":"An upper bound on the distribution of computation for sequential decoding with rate above R"},{"journal-title":"Algebraic decoding for a binary erasure channel","year":"1958","author":"epstein","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"journal-title":"A hybrid sequential and algebraic decoding scheme","year":"1967","author":"falconer","key":"ref5"},{"key":"ref8","volume":"4","author":"jacobs","year":"1965","journal-title":"Probabilities of overflow and error in a coded PSK system with sequential decoding"},{"journal-title":"Limit Distributions for Sums of Independent Random Variables","year":"1954","author":"gnedenko","key":"ref7"},{"year":"0","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(63)90074-3"},{"journal-title":"1966 Internat'l Symp on Information Theory","year":"1966","author":"pinsker","key":"ref9"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22634\/01053977.pdf?arnumber=1053977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:16:53Z","timestamp":1752103013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1053977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1967,4]]},"references-count":14,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1967.1053977","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1967,4]]}}}