{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:26:19Z","timestamp":1733289979085,"version":"3.30.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00250-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"283-304","source":"Crossref","is-referenced-by-count":4,"title":["A combinatorial approach to Golomb forests"],"prefix":"10.1016","volume":"263","author":[{"given":"Mordecai J.","family":"Golin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0304-3975(00)00250-4_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0016-0032(94)90099-X","article-title":"Huffman-type codes for infinite source distributions","volume":"331B","author":"Abrahams","year":"1994","journal-title":"J. Franklin Inst."},{"key":"10.1016\/S0304-3975(00)00250-4_BIB2","unstructured":"J. Abrahams, Code and parse trees for lossless source encoding, Sequences 1997 (1997)."},{"key":"10.1016\/S0304-3975(00)00250-4_BIB3","doi-asserted-by":"crossref","unstructured":"R.G. Gallager, D.C. Van Voorhis, Optimal source codes for geometrically distributed integer alphabets, IEEE Trans. Inform. Theory March 1975 228\u2013230.","DOI":"10.1109\/TIT.1975.1055357"},{"key":"10.1016\/S0304-3975(00)00250-4_BIB4","doi-asserted-by":"crossref","unstructured":"S.W. Golomb Run length encodings IEEE Tran. Informat. Theory IT-12 (1966) 399\u2013401.","DOI":"10.1109\/TIT.1966.1053907"},{"issue":"2","key":"10.1016\/S0304-3975(00)00250-4_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1287\/opre.32.2.423","article-title":"A dichotomous search for a geometric random variable","volume":"32","author":"Hassan","year":"1984","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(00)00250-4_BIB6","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"issue":"1","key":"10.1016\/S0304-3975(00)00250-4_BIB7","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TIT.1978.1055813","article-title":"Optimal source coding for a class of integer alphabets","volume":"IT-24","author":"Humblet","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"345","key":"10.1016\/S0304-3975(00)00250-4_BIB8","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\/S0304-3975(00)00250-4_BIB9","unstructured":"A. Kato, Huffman-like optimal prefix codes and search codes for infinite alphabets, Manuscript, January 20, 1997."},{"issue":"3","key":"10.1016\/S0304-3975(00)00250-4_BIB10","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1109\/18.490559","article-title":"Huffman coding with an infinite alphabet","volume":"42","author":"Kato","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/S0304-3975(00)00250-4_BIB11","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1109\/18.641571","article-title":"Existence of optimal prefix codes for infinite source alphabets","volume":"43","author":"Linder","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(00)00250-4_BIB12","doi-asserted-by":"crossref","unstructured":"N. Merhav, G. Seroussi, M.J. Weinberger, Optimal prefix codes for two-sided geometric distributions (Abstract), Proc. Internat. Sympos. on Information Theory, 1997, p. 71.","DOI":"10.1109\/ISIT.1997.612986"},{"key":"10.1016\/S0304-3975(00)00250-4_BIB13","doi-asserted-by":"crossref","unstructured":"N. Merhav, G. Seroussi, M.J. Weinberger, Universal probability assignment in the class of two-sided geometric distributions (Abstract), Proc. Internat. Symp. on Information Theory, 1997, p. 70.","DOI":"10.1109\/ISIT.1997.612985"},{"year":"1983","series-title":"Algorithms","author":"Sedgewick","key":"10.1016\/S0304-3975(00)00250-4_BIB14"},{"key":"10.1016\/S0304-3975(00)00250-4_BIB15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0378-3758(90)90039-W","article-title":"On optimal nested group testing algorithms","volume":"24","author":"Yao","year":"1990","journal-title":"J. Statist. Plann. Inference"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T17:33:21Z","timestamp":1733247201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002504"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00250-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}