{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:20Z","timestamp":1752192080811,"version":"3.41.2"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1964,4,1]],"date-time":"1964-04-01T00:00:00Z","timestamp":-181526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1964,4,1]],"date-time":"1964-04-01T00:00:00Z","timestamp":-181526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1964,4,1]],"date-time":"1964-04-01T00:00:00Z","timestamp":-181526400000},"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":[[1964,4]]},"DOI":"10.1109\/tit.1964.1053660","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"108-115","source":"Crossref","is-referenced-by-count":13,"title":["Error-limiting coding using information-lossless sequential machines"],"prefix":"10.1109","volume":"10","author":[{"given":"P.","family":"Neumann","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref11b","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(63)90139-6"},{"key":"ref11a","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(63)90139-6"},{"key":"ref1a","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TCT.1959.1086614","article-title":"Canonical forms for information-lossless finite-state logical machines","volume":"ct 6","author":"huffman","year":"1959","journal-title":"IRE Trans Circuit Theory (Special Suppl )"},{"key":"ref3d","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057729"},{"key":"ref3e","first-page":"209","article-title":"On error-limiting variable-length codes","volume":"it 9","year":"1963","journal-title":"IEEE Trans on Information Theory (Correspondence)"},{"journal-title":"Further material on definite automata and on nonprefix codes","year":"1961","key":"ref3b"},{"key":"ref3c","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263534"},{"key":"ref1b","first-page":"41","volume":"it 5","year":"1959","journal-title":"IRE Trans on Information Theory (Special supplement)"},{"key":"ref3a","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057729"},{"journal-title":"Sequential Machines?Selected Papers","year":"1964","key":"ref1c"},{"key":"ref13a","first-page":"1320","article-title":"Self-synchronizing machines for decoding messages","volume":"141","author":"levenstein","year":"1963","journal-title":"Dokl Akad Nauk"},{"key":"ref13b","first-page":"1042","volume":"6","year":"1962","journal-title":"Sov Phys ?Dokl"},{"journal-title":"Introduction to the Theory of Finite-State Machines","year":"1962","author":"gill","key":"ref10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057799"},{"journal-title":"An Introduction to Mathematical Machine Theory","year":"1962","author":"ginsberg","key":"ref15"},{"key":"ref2a","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1962.6"},{"year":"0","key":"ref2b"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1962.3"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/FOCS.1961.38","article-title":"Transient behavior in iterative combinatorial switching networks","author":"kilmer","year":"1961","journal-title":"Proc AIEE Second Ann Symp on Switching Circuit Theory and Logical Design"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/321229.321236"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263532"},{"journal-title":"An adaptive information transmission system employing minimum redundancy word codes","year":"1963","key":"ref16b"},{"journal-title":"Some memory aspects of finite automata","year":"1963","author":"liu","key":"ref7a"},{"key":"ref7b","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263600"},{"volume":"it 10","journal-title":"IEEE Trans on Information Theory","year":"1964","key":"ref14b"},{"year":"0","key":"ref16a"},{"key":"ref14a","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053683"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22622\/01053660.pdf?arnumber=1053660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:16:18Z","timestamp":1752102978000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1053660\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1964,4]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1964.1053660","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1964,4]]}}}