{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T07:04:12Z","timestamp":1743491052469},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1971,4,1]],"date-time":"1971-04-01T00:00:00Z","timestamp":39312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":15449,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1971,4]]},"DOI":"10.1016\/s0019-9958(71)90409-8","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"261-298","source":"Crossref","is-referenced-by-count":22,"title":["Bootstrap hybrid decoding for symmetrical binary input channels"],"prefix":"10.1016","volume":"18","author":[{"given":"F.","family":"Jelinek","sequence":"first","affiliation":[]},{"given":"J.","family":"Cocke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(71)90409-8_bib1","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/TIT.1969.1054337","article-title":"A construction technique for random-error-connecting convolutional codes","volume":"IT-15","author":"Costello","year":"1969","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(71)90409-8_bib2","first-page":"29","article-title":"Error free coding","volume":"IT-4","author":"Elias","year":"1954","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(71)90409-8_bib3","article-title":"A Hybrid Sequential and Algebraic Decoding Scheme","author":"Falconer","year":"1967"},{"key":"10.1016\/S0019-9958(71)90409-8_bib4","first-page":"3","article-title":"A hybrid coding scheme for discrete memoryless channels","volume":"48","author":"Falconer","year":"1969","journal-title":"Bell System Telephone Journal"},{"key":"10.1016\/S0019-9958(71)90409-8_bib5","first-page":"2","article-title":"A heuristic introduction to probabilistic decoding","volume":"IT-9","author":"Fano","year":"1963","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(71)90409-8_bib6","series-title":"Concatenated Codes","author":"Forney","year":"1967"},{"key":"10.1016\/S0019-9958(71)90409-8_bib7","article-title":"A Study of Hybrid Sequential and Algebraic Coding Techniques","author":"Forney","year":"1969","journal-title":"Final Report to NASA Ames Research Center by Codex Corporation"},{"key":"10.1016\/S0019-9958(71)90409-8_bib8","series-title":"Low Density Parity Check Codes","author":"Gallager","year":"1963"},{"key":"10.1016\/S0019-9958(71)90409-8_bib9","article-title":"Channel coding with a sequential-algebraic coding scheme","volume":"COM-19","author":"Huband","year":"1971","journal-title":"IEEE Transactions on Communication Technology"},{"key":"10.1016\/S0019-9958(71)90409-8_bib10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TIT.1967.1053977","article-title":"A lower bound to the distribution of computation for sequential decoding","volume":"IT-13","author":"Jacobs","year":"1967","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(71)90409-8_bib11","series-title":"Probabilistic Information Theory","author":"Jelinek","year":"1968"},{"key":"10.1016\/S0019-9958(71)90409-8_bib12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/TIT.1969.1054264","article-title":"An upper bound on moments of sequential decoding effort","volume":"IT-15","author":"Jelinek","year":"1969","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(71)90409-8_bib13","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1147\/rd.136.0675","article-title":"A stack algorithm for faster sequential decoding of transmitted information","volume":"13","author":"Jelinek","year":"1969","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0019-9958(71)90409-8_bib14","article-title":"Adaptive Hybrid Sequential Decoding","author":"Jelinek","year":"1969","journal-title":"IBM Research Report, RC-2593"},{"key":"10.1016\/S0019-9958(71)90409-8_bib15","first-page":"113","article-title":"O Slo\u017enosti Dekodirovaniia","volume":"1","author":"Pinsker","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S0019-9958(71)90409-8_bib16","first-page":"13","article-title":"Nekotorye Posledovatel'nye Protsedury Dekodirovania","volume":"2","author":"Zigangirov","year":"1966","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871904098?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871904098?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:50:44Z","timestamp":1548928244000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995871904098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,4]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,4]]}},"alternative-id":["S0019995871904098"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(71)90409-8","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1971,4]]}}}