{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:23Z","timestamp":1752192083106,"version":"3.41.2"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1969,1,1]],"date-time":"1969-01-01T00:00:00Z","timestamp":-31536000000},"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":[[1969,1]]},"DOI":"10.1109\/tit.1969.1054264","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"140-149","source":"Crossref","is-referenced-by-count":29,"title":["An upper bound on moments of sequential decoding effort"],"prefix":"10.1109","volume":"15","author":[{"given":"F.","family":"Jelinek","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"private communication","year":"1964","author":"yudkin","key":"ref4"},{"journal-title":"A hybrid sequential and algebraic decoding scheme","year":"1966","author":"falconer","key":"ref3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053875"},{"journal-title":"Probabilistic Information Theory","year":"1968","author":"jelinek","key":"ref6"},{"key":"ref5","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"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053977"},{"journal-title":"Transmission of Information","year":"1961","author":"fano","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0621713","author":"savage","year":"1965","journal-title":"The computation problem with sequential decoding"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1002\/j.1538-7305.1966.tb04210.x","article-title":"Sequential decoding?the computation problem","volume":"45","author":"savage","year":"1966","journal-title":"Bell Sys Tech J"},{"key":"ref1","article-title":"Bounds on the performance of an economical sequential decoder","author":"jelinek","year":"1968","journal-title":"1968 Hawaii Internatl Conf in System Sciences"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22643\/01054264.pdf?arnumber=1054264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:16:54Z","timestamp":1752103014000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1054264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,1]]},"references-count":10,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1969.1054264","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1969,1]]}}}