{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:37:06Z","timestamp":1725467826389},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387976280"},{"type":"electronic","value":"9780387348155"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0038489","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T09:59:13Z","timestamp":1153994353000},"page":"170-178","source":"Crossref","is-referenced-by-count":1,"title":["Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm"],"prefix":"10.1007","author":[{"given":"Yehoshua","family":"Perl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"25_CR1","unstructured":"Y. Choueka, A.S. Fraenkel, Y. Perl.: Polynomial construction of optimal prefix tables for text compression. Proc. 19th Annual Allerton Conferences on Communication, control and Computing, 1981, 762\u2013768."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF00264280","volume":"20","author":"A. S. Fraenkel","year":"1983","unstructured":"A. S. Fraenkel, M. Mor, Y. Perl.: Is text compression by prefixes and suffixes practical? Acta Informatica 20, 1983, 371\u2013389.","journal-title":"Acta Informatica"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D.A. Huffman","year":"1951","unstructured":"D.A. Huffman.: A method for the construction of minimum redundancy codes. [A In Proc. IRE 40 (1951). 1098\u20131101.","journal-title":"[A In Proc. IRE"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0271(73)90089-2","volume":"9","author":"M.F. Lynch","year":"1973","unstructured":"M.F. Lynch.: Compression of bibliographic files using an adoption of run-length coding. Infor. Stor. Retr. 9, 1973, 207\u2013214.","journal-title":"Infor. Stor. Retr."},{"key":"25_CR5","unstructured":"Y. Perl, S. Chatterjee, T. Mahapatra.: Incorporating updates into the LZW compression algorithm. N.J.I.T. Technical report."},{"key":"25_CR6","unstructured":"Y. Perl, S. Gupta, A. Shrivastava, Towards a bound for the compression of the LZW algorithm. N.J.I.T. Technical report."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"J.A.Storer, T.G. Szymanski.:The macro model for data compression. Extended Abstract. Proc. Tenth Annual ACM symposium on theory of computing, San Diego, CA, 1978, 30\u201339.","DOI":"10.1145\/800133.804329"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"J.A. Storer","year":"1982","unstructured":"J.A. Storer, T.G. Szymanski.: Data compression via textual substitution. JACM 29, 1982, 928\u2013951.","journal-title":"JACM"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"M.E.G. Smith, J.A. Storer.: Parallel Algorithms Data Compression, JACM, Vol. 32 No. 2, April 1985.","DOI":"10.1145\/3149.3152"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"T.A. Welch.: A technique for high performance data compression, IEEE Computer Journal, 1984, 8\u201319.","DOI":"10.1109\/MC.1984.1659158"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv, A. Lempel.: A universal algorithm for sequencial data compression. IEEE Trans. on Info. theory, Vol.IT-23, 1977, 337\u2013343.","journal-title":"IEEE Trans. on Info. theory"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"IT","author":"J. Ziv","year":"1978","unstructured":"J. Ziv, A. Lempel.: Compression of individual sequences via variable-rate coding.: IEEE Trans. on Info. Theory, Vol.IT, 1978, 530\u2013536.","journal-title":"IEEE Trans. on Info. Theory"}],"container-title":["Lecture Notes in Computer Science","Computing in the 90's"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0038489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:41:18Z","timestamp":1555749678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0038489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780387976280","9780387348155"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0038489","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}