{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:09:30Z","timestamp":1775052570812,"version":"3.50.1"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1984,9,1]],"date-time":"1984-09-01T00:00:00Z","timestamp":462844800000},"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":[[1984,9]]},"DOI":"10.1109\/tit.1984.1056961","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"762-766","source":"Crossref","is-referenced-by-count":10,"title":["A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)"],"prefix":"10.1109","volume":"30","author":[{"given":"M.","family":"Cedervall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Johannesson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Zigangirov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055704"},{"key":"ref3","article-title":"New bounds on the performance of binary convolutional codes using Viterbi decoding on a binary symmetric channel","author":"post","year":"1980","journal-title":"Proceedings Symposium over Informatietheorie in de Benelux"},{"key":"ref6","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056098"},{"key":"ref8","author":"viterbi","year":"1979","journal-title":"Principles of Digital Communication and Coding"},{"key":"ref7","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 Inform Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055216"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055397"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090700"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22744\/01056961.pdf?arnumber=1056961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:41Z","timestamp":1753121261000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056961\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,9]]},"references-count":9,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1984.1056961","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,9]]}}}