{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:41:29Z","timestamp":1694626889730},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1109\/tcom.1980.1094736","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:29:18Z","timestamp":1083198558000},"page":"825-830","source":"Crossref","is-referenced-by-count":9,"title":["Speech Encoding by a Stack Algorithm"],"prefix":"10.1109","volume":"28","author":[{"given":"S.","family":"Mohan","sequence":"first","affiliation":[]},{"given":"J.","family":"Anderson","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","author":"mohan","year":"1979","journal-title":"Analyses and cost evaluation of code tree search algorithms"},{"key":"ref11","article-title":"A cost function for sequential coding","author":"ahderson","year":"1978","journal-title":"Conf Proc Sixteenth Annu Allerton Conf Commun Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055415"},{"key":"ref13","first-page":"34.2.1","article-title":"A performance bound for tree search coding of speech with minimum phase codes","author":"uddenfeldt","year":"1978","journal-title":"Conf Rec 1978 Int Conf Commun"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094232"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094248"},{"key":"ref16","first-page":"13","article-title":"Some sequential decoding procedures","volume":"2","author":"zigangirov","year":"1966","journal-title":"Probl Peredach Inform"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055787"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055463"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055196"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054934"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0146-664X(78)80002-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055166"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.136.0675"},{"key":"ref1","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":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054829"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/23927\/01094736.pdf?arnumber=1094736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:41:36Z","timestamp":1638218496000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1094736\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1980,6]]}},"URL":"https:\/\/doi.org\/10.1109\/tcom.1980.1094736","relation":{},"ISSN":["0096-2244"],"issn-type":[{"value":"0096-2244","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}