{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:49:39Z","timestamp":1648579779853},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1016\/0020-0255(86)90036-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"211-216","source":"Crossref","is-referenced-by-count":7,"title":["A Short Note on the Redundancy of Degree \u03b1"],"prefix":"10.1016","volume":"39","author":[{"given":"Inder","family":"Jeet Taneja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(86)90036-8_BIB1","series-title":"Information Theory","author":"Ash","year":"1965"},{"key":"10.1016\/0020-0255(86)90036-8_BIB2","article-title":"Bounds on the redundancy of noiseless source coding","author":"Blumer","year":"1982"},{"key":"10.1016\/0020-0255(86)90036-8_BIB3","first-page":"30","article-title":"Quantification method of classification processes: Concept of structural a-entropy","volume":"3","author":"Havrda","year":"1967","journal-title":"Kybernetika"},{"key":"10.1016\/0020-0255(86)90036-8_BIB4","first-page":"1098","article-title":"A Method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0020-0255(86)90036-8_BIB5","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TIT.1980.1056158","article-title":"On the redundancy of binary Huffman codes","volume":"IT-26","author":"Johnsen","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0255(86)90036-8_BIB6","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0209035","article-title":"Conditions for optimality of the Huffman algorithm","volume":"9","author":"Parker","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0255(86)90036-8_BIB7","first-page":"199","article-title":"A short note on exponentiated mean codeword length for the best 1:1 code","volume":"3","author":"Taneja","year":"1984","journal-title":"Mat. Apl. Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900368?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025586900368?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T08:56:41Z","timestamp":1552899401000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025586900368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["0020025586900368"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(86)90036-8","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}