{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:56:41Z","timestamp":1767898601484,"version":"3.49.0"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1979,5,1]],"date-time":"1979-05-01T00:00:00Z","timestamp":294364800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1979,5,1]],"date-time":"1979-05-01T00:00:00Z","timestamp":294364800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1979,5,1]],"date-time":"1979-05-01T00:00:00Z","timestamp":294364800000},"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":[[1979,5]]},"DOI":"10.1109\/tit.1979.1056040","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"356-360","source":"Crossref","is-referenced-by-count":10,"title":["A decision procedure for the unique decipherability of multivalued encodings (Corresp.)"],"prefix":"10.1109","volume":"25","author":[{"given":"K.","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref9a","first-page":"181","article-title":"Decipherability of gsm encoding","volume":"57","author":"sato","year":"1974","journal-title":"Electron Commun Japan Trans IECE"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057817"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057500"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1147\/rd.91.0047"},{"key":"ref6","first-page":"1274","article-title":"Certain properties of code systems","volume":"140","author":"levenshtein","year":"1961","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1962.6"},{"key":"ref8","author":"ginsburg","year":"1966","journal-title":"The Mathematical Theory of Context-Free Languages"},{"key":"ref7","first-page":"560","article-title":"On alphabet coding","volume":"139","author":"markov","year":"1961","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"key":"ref9b","first-page":"53","volume":"5","year":"1974","journal-title":"Syst Comput Contr"},{"key":"ref1","first-page":"104","article-title":"A necessary and sufficient condition for unique decomposition of coded messages","author":"sardinas","year":"0","journal-title":"1953 IRE Conv Rec"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22708\/01056040.pdf?arnumber=1056040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:47Z","timestamp":1752103067000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,5]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.1979.1056040","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,5]]}}}