{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:20:22Z","timestamp":1774416022548,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1983,9,1]],"date-time":"1983-09-01T00:00:00Z","timestamp":431222400000},"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":[[1983,9]]},"DOI":"10.1109\/tit.1983.1056739","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"637-649","source":"Crossref","is-referenced-by-count":36,"title":["Bounds on distances and error exponents of unit memory codes"],"prefix":"10.1109","volume":"29","author":[{"given":"C.","family":"Thommesen","sequence":"first","affiliation":[]},{"given":"J.","family":"Justesen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"58","article-title":"Bounds of the probability and of the number of correctable errors for nonblock codes","volume":"3","author":"pinsker","year":"1967","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref11","first-page":"89","author":"massey","year":"1968","journal-title":"Error Correcting Codes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055223"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056194"},{"key":"ref14","author":"viterbi","year":"1979","journal-title":"Principles of Digital Communication and Coding"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054375"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055850"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054541"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055519"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054054"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(74)90870-5"},{"key":"ref1","first-page":"349","article-title":"Short unit-memory byte-oriented binary convolutional codes having maximal free distance","volume":"it 22","author":"lee","year":"1976","journal-title":"IEEE Trans Inform Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055724"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22734\/01056739.pdf?arnumber=1056739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:36Z","timestamp":1753121256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":15,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1983.1056739","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}