{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:57:00Z","timestamp":1761947820898,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315121"},{"type":"electronic","value":"9783642315138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31513-8_75","type":"book-chapter","created":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T09:39:17Z","timestamp":1340962757000},"page":"739-748","source":"Crossref","is-referenced-by-count":7,"title":["Adaptive Region Based Huffman Compression Technique with Selective Code Interchanging"],"prefix":"10.1007","author":[{"given":"Utpal","family":"Nandi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyotsna Kumar","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","unstructured":"Nandi, U., Mandal, J.K.: Size Adaptive Region based Huffman Compression. In: National Symposium on Emerging Trends in Computer Science (ETCS), Barrackpore, India (2012)"},{"issue":"2","key":"75_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.22452\/mjcs.vol23no2.4","volume":"23","author":"U. Nandi","year":"2010","unstructured":"Nandi, U., Mandal, J.K.: Region based Huffman(RB H) Compression Technique with Code Interchange. Malayasian Journal of Computer Science(MJCS), Malayasia\u00a023(2), 111\u2013120 (2010)","journal-title":"Malayasian Journal of Computer Science(MJCS), Malayasia"},{"key":"75_CR3","unstructured":"Mandal, J.K., Kumar, A.: A Compression Technique Based on Optimality of Huffman Tree (OHT). In: 12th International Conference of IEEE on Advanced Computing and Communications, Ahmedabad, India, pp. 589\u2013595 (2004)"},{"issue":"5","key":"75_CR4","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"75_CR5","first-page":"154","volume-title":"First International Workshop on Telematics","author":"J.K. Mandal","year":"1995","unstructured":"Mandal, J.K., Gangopadhayay, R.: Implementation of Two Data Compression Schemes. In: First International Workshop on Telematics, pp. 154\u2013162. NERIST, India (1995)"},{"key":"75_CR6","doi-asserted-by":"crossref","unstructured":"Reglebati, H.K.: An Overview of Data Compression Techniques. IEEE Computer, 71\u201375 (1981)","DOI":"10.1109\/C-M.1981.220416"},{"issue":"5","key":"75_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"75_CR8","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"T. Welch","year":"1984","unstructured":"Welch, T.: A Technique for High-Performance Data Compression. IEEE Computer\u00a017(6), 8\u201319 (1984)","journal-title":"IEEE Computer"},{"issue":"6","key":"75_CR9","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"I.H. Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic Coding for Data Compression. Communications of the ACM\u00a030(6), 520\u2013540 (1987)","journal-title":"Communications of the ACM"},{"issue":"3","key":"75_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"75_CR11","unstructured":"Nelson, M.: The Data Compression Book, 2nd edn. BPB Publications, India (2008)"},{"key":"75_CR12","volume-title":"C project","author":"Y. Kanitkar","year":"2002","unstructured":"Kanitkar, Y.: C project, 2nd edn. BPB Publications, India (2002)","edition":"2"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Computing and Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31513-8_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T19:34:29Z","timestamp":1676576069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31513-8_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315121","9783642315138"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31513-8_75","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2012]]}}}