{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:28Z","timestamp":1774678708816,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0166-218x(93)00116-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"31-55","source":"Crossref","is-referenced-by-count":71,"title":["Robust universal complete codes for transmission and compression"],"prefix":"10.1016","volume":"64","author":[{"given":"Aviezri S.","family":"Fraenkel","sequence":"first","affiliation":[]},{"given":"Shmuel T.","family":"Kleinb","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)00116-H_BIB1","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","article-title":"Robust transmission of unbounded strings using Fibonacci representations","volume":"33","author":"Apostolico","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB2","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/0166-218X(93)00116-H_BIB3","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/0166-218X(93)00116-H_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02243872","article-title":"Is Huffman coding dead?","volume":"50","author":"Bookstein","year":"1993","journal-title":"Computing"},{"key":"10.1016\/0166-218X(93)00116-H_BIB5","series-title":"Proceedings of the 8th ACM-SIGIR Conference","first-page":"122","article-title":"Efficient variants of Huffman codes in high level languages","author":"Choueka","year":"1985"},{"key":"10.1016\/0166-218X(93)00116-H_BIB6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","article-title":"Universal codeword sets and representation of the integers","volume":"12","author":"Elias","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/359460.359480","article-title":"Economical encoding of commas between strings","volume":"21","author":"Even","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(93)00116-H_BIB8","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1109\/TIT.1984.1056931","article-title":"Self-synchronizing Huffman codes","volume":"30","author":"Ferguson","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB9","first-page":"149","article-title":"All about the responsa retrieval project you always wanted to know but were afraid to ask, expanded summary","volume":"16","author":"Fraenkel","year":"1976","journal-title":"Jurimetrics J."},{"key":"10.1016\/0166-218X(93)00116-H_BIB10","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2322638","article-title":"Systems of numeration","volume":"92","author":"Fraenkel","year":"1985","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(93)00116-H_BIB11","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0890-5401(89)90028-X","article-title":"The use and usefulness of numeration systems","volume":"81","author":"Fraenkel","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0166-218X(93)00116-H_BIB12","series-title":"Combinatorial Algorithms on Words","first-page":"169","article-title":"Novel compression of sparse bit-strings \u2014 preliminary report","author":"Fraenkel","year":"1985"},{"key":"10.1016\/0166-218X(93)00116-H_BIB13","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/TIT.1960.1057587","article-title":"Synchronization of binary messages","volume":"6","author":"Gilbert","year":"1960","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/0135034","article-title":"Maximal prefix-synchronized codes","volume":"35","author":"Guibas","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(93)00116-H_BIB15","series-title":"Coding and Information Theory","author":"Hamming","year":"1986"},{"key":"10.1016\/0166-218X(93)00116-H_BIB16","series-title":"Computational and Theoretical Aspects","article-title":"Information Retrieval","author":"Heaps","year":"1978"},{"key":"10.1016\/0166-218X(93)00116-H_BIB17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/77556.77566","article-title":"Efficient decoding of prefix codes","volume":"33","author":"Hirschberg","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(93)00116-H_BIB18","first-page":"1098","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0166-218X(93)00116-H_BIB19","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0020-0190(78)90023-6","article-title":"Huffman coding in bit-vector compression","volume":"7","author":"Jakobsson","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(93)00116-H_BIB20","doi-asserted-by":"crossref","first-page":"178","DOI":"10.4153\/CJM-1963-021-1","article-title":"Recent results in comma-free codes","volume":"15","author":"Jiggs","year":"1963","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(93)00116-H_BIB21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1965.1053772","article-title":"Fibonacci codes for synchronization control","volume":"11","author":"Kautz","year":"1965","journal-title":"IEEE Trans. Inform Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB22","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/TIT.1981.1056387","article-title":"On universal codeword sets","volume":"27","author":"Lakshmanan","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/45072.45074","article-title":"Data compression","volume":"19","author":"Lelewer","year":"1987","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0166-218X(93)00116-H_BIB24","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/TIT.1956.1056818","article-title":"Two inequalities implied by unique decipherability","volume":"2","author":"McMillan","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB25","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"key":"10.1016\/0166-218X(93)00116-H_BIB26","series-title":"Adaptive Data Compression","author":"Williams","year":"1990"},{"key":"10.1016\/0166-218X(93)00116-H_BIB27","first-page":"179","article-title":"Repr\u00e9sentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas","volume":"41","author":"Zeckendorf","year":"1972","journal-title":"Bull. Soc. Roy. Sci. Li\u00e9ge"},{"key":"10.1016\/0166-218X(93)00116-H_BIB28","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(93)00116-H_BIB29","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inform. Theory."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9300116H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9300116H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:03Z","timestamp":1556130423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9300116H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0166218X9300116H"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)00116-h","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}