{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:12:27Z","timestamp":1649005947743},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1007\/bf01516009","type":"journal-article","created":{"date-parts":[[2005,4,21]],"date-time":"2005-04-21T08:41:02Z","timestamp":1114072862000},"page":"23-40","source":"Crossref","is-referenced-by-count":5,"title":["Huffman algebras for independent random variables"],"prefix":"10.1007","volume":"4","author":[{"given":"Cheng-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Joy A.","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Statistical Theory of Reliability and Life Testing Probability Models","author":"R.E. Barlow","year":"1988","unstructured":"Barlow, R.E., and Proschan, F. 1988.Statistical Theory of Reliability and Life Testing Probability Models. New York: Holt, Reinhart and Winston."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"761","DOI":"10.2307\/3212379","volume":"10","author":"M. Brown","year":"1973","unstructured":"Brown, M., and Solomon, H. 1973. Optimal issuing policies under stochastic field lives.J. Appl. Probab. 10, pp. 761?768.","journal-title":"J. Appl. Probab."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00537132","volume":"6","author":"L.L. Campbell","year":"1966","unstructured":"Campbell, L.L. 1966. Definition of entropy by means of a coding problem.Z. Wahrsch. verw. Gebiete 6, pp. 113?118.","journal-title":"Z. Wahrsch. verw. Gebiete"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"604","DOI":"10.2307\/1427482","volume":"24","author":"C.S. Chang","year":"1992","unstructured":"Chang, C.S. 1992. A new ordering for stochastic majorization: theory and applications.Adv. Appl. Probab. 24, pp. 604?634.","journal-title":"Adv. Appl. Probab."},{"key":"CR5","unstructured":"Chang, C.S. and Thomas, J.A. 1992. Huffman algebras for independent random variables.IBM RC 17524."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1287\/moor.18.3.658","volume":"18","author":"C.S. Chang","year":"1993","unstructured":"Chang, C.S., and Yao, D.D. 1993. Rearrangement, majorization and stochastic scheduling.Math. Oper. Res., 18, pp. 659?684","journal-title":"Math. Oper. Res."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1137\/0131030","volume":"31","author":"C.R. Glassey","year":"1976","unstructured":"Glassey, C.R., and Karp, R.M. 1976. On the optimality of Huffman trees.SIAM J. Appl. math. 31, pp. 368?378.","journal-title":"SIAM J. Appl. math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1109\/TC.1976.1674574","volume":"25","author":"M.C. Golumbic","year":"1976","unstructured":"Golumbic, M.C. 1976. Combinatorial merging.IEEE Trans. Comput. C-25, pp. 1164?1167.","journal-title":"IEEE Trans. Comput. C"},{"key":"CR9","volume-title":"Inequalities","author":"G.H. Hardy","year":"1952","unstructured":"Hardy, G.H., Littlewood, J.E., and Polya, G. 1952.Inequalities. London and New York: Cambridge University Press."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1137\/0137015","volume":"37","author":"T.C. Hu","year":"1979","unstructured":"Hu, T.C., Kleitman, D. and Tamaki, J.K. 1979. Binary trees optimum under various criteria.SIAM J. Appl. Math. 37, pp. 246?256.","journal-title":"SIAM J. Appl. Math."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0121057","volume":"21","author":"T.C. Hu","year":"1971","unstructured":"Hu, T.C., and Tucker, A.C. 1971. Optimal computer search trees and variable length alphabetic codes.SIAM J. Appl. Math. 21, pp. 514?532.","journal-title":"SIAM J. Appl. Math."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1952","unstructured":"Huffman, D.A. 1952. A method for the construction of minimum redundancy codes.Proc. IRE 40, 1098?1101.","journal-title":"Proc. IRE"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/TIT.1981.1056322","volume":"27","author":"P.A. Humblet","year":"1981","unstructured":"Humblet, P.A. 1981. Generalization of Huffman coding to minimize the probability of buffer overflow.IEEE Trans. Inform. Theory IT-27, pp. 230?232.","journal-title":"IEEE Trans. Inform. Theory IT"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/0137008","volume":"37","author":"F.K. Hwang","year":"1979","unstructured":"Hwang, F.K. 1979. Generalized Huffman trees.SIAM J. Appl. Math. 37, pp. 124?127.","journal-title":"SIAM J. Appl. Math."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1137\/0205002","volume":"5","author":"A. Itai","year":"1976","unstructured":"Itai, A. 1976. Optimal algebraic trees.SIAM J. Comput. 5, pp. 9?18.","journal-title":"SIAM J. Comput."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/3556181","volume":"10","author":"J. Keilson","year":"1982","unstructured":"Keilson, J., and Sumita, U. 1982. Uniform stochastic ordering and related inequalities.The Can. J. Statist. 10, pp. 181?198.","journal-title":"The Can. J. Statist."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0097-3165(82)90021-8","volume":"32","author":"D.E. Knuth","year":"1982","unstructured":"Knuth, D.E. 1982. Huffman's algorithm via algebra.J. Combin. Theory Ser. A 32, pp. 216?224.","journal-title":"J. Combin. Theory Ser. A"},{"key":"CR18","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A.W. Marshall","year":"1979","unstructured":"Marshall, A.W., and Olkin, I. 1979.Inequalities: Theory of Majorization and Its Applications. San Diego: Academic Press."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TC.1979.1675367","volume":"28","author":"D.S. Parker","year":"1979","unstructured":"Parker, D.S. 1979. Combinatorial merging and Huffman's algorithm.IEEE Trans. Comput. TC-28, pp. 365?367.","journal-title":"IEEE Trans. Comput. TC"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1137\/0209035","volume":"9","author":"D.S. Parker","year":"1980","unstructured":"Parker, D.S. 1980. Conditions for optimality of the Huffman algorithm.SIAM J. Comput. 9, pp. 470?489.","journal-title":"SIAM J. Comput."},{"key":"CR21","first-page":"547","volume":"I","author":"A. Renyi","year":"1961","unstructured":"Renyi, A. 1961. On measuresof entropy and information.Proc. Fourth Berkeley Symp. Math. Statist. Probability I, pp. 547?561.","journal-title":"Proc. Fourth Berkeley Symp. Math. Statist. Probability"},{"key":"CR22","volume-title":"Stochastic Processes","author":"S.M. Ross","year":"1983","unstructured":"Ross, S.M. 1983.Stochastic Processes. New York: Wiley."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"642","DOI":"10.2307\/1427627","volume":"23","author":"J.G. Shanthikumar","year":"1991","unstructured":"Shanthikumar, J.G., and Yao, D.D. 1991. Bivariate characterization of some stochastic order relations.Adv. Appl. Probab. 23, pp. 642?659.","journal-title":"Adv. Appl. Probab."},{"key":"CR24","volume-title":"Comparison Methods for Queues and Other Stochastic Models","author":"D. Stoyan","year":"1983","unstructured":"Stoyan, D. 1983.Comparison Methods for Queues and Other Stochastic Models. New York: Wiley."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"841","DOI":"10.2307\/3214023","volume":"23","author":"R.R. Weber","year":"1986","unstructured":"Weber, R.R., Varaiya, P., and Walrand, J. 1986. Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime.J. Appl. Probabl. 23, pp. 841?847.","journal-title":"J. Appl. Probabl."}],"container-title":["Discrete Event Dynamic Systems: Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01516009\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01516009.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01516009\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01516009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T12:51:36Z","timestamp":1556887896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01516009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01516009"],"URL":"https:\/\/doi.org\/10.1007\/bf01516009","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}