{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:27:48Z","timestamp":1771705668386,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0020-0255(01)00101-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:51:15Z","timestamp":1027626675000},"page":"57-70","source":"Crossref","is-referenced-by-count":7,"title":["On the average redundancy rate of the Lempel\u2013Ziv code with the k-error protocol"],"prefix":"10.1016","volume":"135","author":[{"given":"Yuriy A.","family":"Reznik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(01)00101-3_BIB1","series-title":"Text Compression","author":"Bell","year":"1990"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB2","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1991"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB3","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB4","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0215054","article-title":"Digital search trees revisited","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(01)00101-3_BIB5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.3240030309","article-title":"Generalized digital trees and their difference-differential equations","volume":"3","author":"Flajolet","year":"1992","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(94)00298-W","article-title":"Asymptotic behavior of the Lempel\u2013Ziv parsing scheme and digital search trees","volume":"144","author":"Jacquet","year":"1995","journal-title":"Theoret. Computer Sci."},{"key":"10.1016\/S0020-0255(01)00101-3_BIB7","doi-asserted-by":"crossref","unstructured":"P. Jacquet, W. Szpankowski, J. Tang, Average Profile of the Lempel\u2013Ziv Parsing Scheme for a Markovian Source, Algorithmica (to appear)","DOI":"10.1007\/s00453-001-0053-3"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB8","unstructured":"D. Knuth, The Art of Computer Programming. Fundamental Algorithms, vol. 1, Addison-Wesley, Reading, MA, 1968"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB9","unstructured":"D. Knuth, The Art of Computer Programming. Sorting and Searching, vol. 3, Addison-Wesley, Reading, MA, 1973"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB10","first-page":"259","article-title":"Digital search trees revisited","volume":"36","author":"Louchard","year":"1995","journal-title":"Cahiers du CERO"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB11","doi-asserted-by":"crossref","unstructured":"G. Louchard, W. Szpankowski, Generalized Lempel\u2013Ziv parsing scheme and its preliminary analysis of the average profile, in: Proceedings of IEEE Data Compression Conference, Snowbird, UT, 1995, pp. 262\u2013271","DOI":"10.1109\/DCC.1995.515516"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/18.567640","article-title":"On the average redundancy rate of the Lempel-Ziv code","volume":"43","author":"Louchard","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB13","first-page":"935","article-title":"Average profile of the generalized digital search tree and the generalized Lempel\u2013Ziv algorithm","volume":"28","author":"Louchard","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(01)00101-3_BIB14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/18.567642","article-title":"Redundancy of the Lempel\u2013Ziv incremental parsing rule","volume":"43","author":"Savari","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB15","unstructured":"J.B. Seery, J. Ziv, Further Results on Universal Data Compression, Technical Memorandum 78-1212-8, Bell Laboratories, Murray Hill, NJ, 1978"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB16","series-title":"Data Compression: Methods and Theory","author":"Storer","year":"1988"},{"issue":"4","key":"10.1016\/S0020-0255(01)00101-3_BIB17","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/S0097539792240789","article-title":"Error resilient optimal data compression","volume":"26","author":"Storer","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(01)00101-3_BIB18","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/18.45281","article-title":"Some asymptotic properties of the entropy of a stationary ergodic data source with application to data compression","volume":"35","author":"Wyner","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0255(01)00101-3_BIB19","doi-asserted-by":"crossref","first-page":"536","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":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025501001013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T05:24:30Z","timestamp":1555910670000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025501001013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0020025501001013"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(01)00101-3","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}