{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:23:07Z","timestamp":1772756587438,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12251,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1980]]},"DOI":"10.1016\/0012-365x(80)90051-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:00Z","timestamp":1027655100000},"page":"163-165","source":"Crossref","is-referenced-by-count":5,"title":["An explicit expression for the cost of a class of Huffman trees"],"prefix":"10.1016","volume":"32","author":[{"given":"F.K.","family":"Hwang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(80)90051-5_BIB1","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable-length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0012-365X(80)90051-5_BIB2","first-page":"1091","article-title":"A method for the construction of minimum redundancy code","volume":"40","author":"Huffman","year":"1959","journal-title":"Proceedings of IRE"},{"key":"10.1016\/0012-365X(80)90051-5_BIB3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/01621459.1974.10480141","article-title":"On finding a single defective in binomial group testing","volume":"69","author":"Hwang","year":"1974","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0012-365X(80)90051-5_BIB4","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0012-365X(80)90051-5_BIB5","series-title":"Ph.D. Thesis","article-title":"Application of group-testing methods to medically oriented problems: Optimal properties of a recursive group-testing procedure for the problem of at most D defectives","author":"Lin","year":"1974"},{"key":"10.1016\/0012-365X(80)90051-5_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.2307\/2312475","article-title":"On an optimal search procedure","volume":"68","author":"Sandelius","year":"1961","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(80)90051-5_BIB7","article-title":"Group-testing with at most D defectives: Binomial and hypergeometric models","author":"Sobel","year":"1973","journal-title":"Univ. of Minnesota School of Statistics Tech. Report No. 204"},{"key":"10.1016\/0012-365X(80)90051-5_BIB8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0097-3165(74)90051-X","article-title":"The cost of a class of optimal binary trees","volume":"16","author":"Tucker","year":"1974","journal-title":"J. Combinatorial Theory (A)"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80900515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X80900515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:24Z","timestamp":1555134684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X80900515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980]]}},"alternative-id":["0012365X80900515"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(80)90051-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1980]]}}}