{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:10:17Z","timestamp":1743052217150,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811536069"},{"type":"electronic","value":"9789811536076"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3607-6_25","type":"book-chapter","created":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T11:03:09Z","timestamp":1590145389000},"page":"309-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Faster Decoding Technique for Huffman Codes Using Adjacent Distance Array"],"prefix":"10.1007","author":[{"given":"Mir Lutfur","family":"Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranta","family":"Sarker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahsan","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,23]]},"reference":[{"issue":"9","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman DA (1952) A method for the construction of minimum redundancy codes. Proc IRE 40(9):1098\u20131101","journal-title":"Proc IRE"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0165-1684(97)00125-4","volume":"62","author":"KL Chung","year":"1997","unstructured":"Chung KL, Lin YK (1997) A novel memory-efficient Huffman decoding algorithm and its implementation. Sig Process 62(2):207\u2013213","journal-title":"Sig Process"},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(99)00002-2","volume":"69","author":"HC Chen","year":"1999","unstructured":"Chen HC, Wang YL, Lan YF (1999) A memory efficient and fast Huffman decoding algorithm. Inf Process Lett 69(3):119\u2013122","journal-title":"Inf Process Lett"},{"issue":"10","key":"25_CR4","doi-asserted-by":"publisher","first-page":"2576","DOI":"10.1109\/26.469442","volume":"43","author":"R Hashemian","year":"1995","unstructured":"Hashemian R (1995) Memory efficient and high-speed search Huffman coding. IEEE Trans Commun 43(10):2576\u20132581","journal-title":"IEEE Trans Commun"},{"key":"25_CR5","unstructured":"Lin YK, Chung KL (2000) A space-efficient Huffman decoding algorithm and its parallelism. Theor Comput Sci 246(1\u20132):227\u2013238"},{"issue":"6","key":"25_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0020-0190(01)00243-5","volume":"81","author":"RA Chowdhury","year":"2002","unstructured":"Chowdhury RA, Kaykobad M, King L (2002) An efficient decoding technique for Huffman codes. Inf Process Lett 81(6):305\u2013308","journal-title":"Inf Process Lett"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TCOMM.2003.822145","volume":"52","author":"R Hashemian","year":"2004","unstructured":"Hashemian R (2004) Condensed table of Huffman coding, a new approach to efficient decoding. IEEE Trans Commun 52(1):6\u20138","journal-title":"IEEE Trans Commun"},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TSA.2005.852989","volume":"13","author":"SJ Lee","year":"2005","unstructured":"Lee SJ, Jeong HJ, Chang GT (2005) An efficient method of Huffman decoding for MPEG-2 AAC and its performance analysis. IEEE Trans Speech Audio Process 13(6):1206\u20131209","journal-title":"IEEE Trans Speech Audio Process"},{"key":"25_CR9","unstructured":"Wang CP, Lee LC, Chang YH (2007) An efficient algorithm of Huffman decoder with nearly constant decoding time. In: CSS 2007 proceedings of the 5th IASTED international conference on circuits, signals and systems. ACM Digital Library, Banff, Alberta, Canada, pp 131\u2013135"},{"issue":"8","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TC.2007.1057","volume":"56","author":"X Kavousianos","year":"2007","unstructured":"Kavousianos X, Kalligeros E, Nikolos D (2007) Optimal selective Huffman coding for test-data compression. IEEE Trans Comput 56(8):1146\u20131152","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"25_CR11","first-page":"416","volume":"1","author":"SR Kodituwakku","year":"2013","unstructured":"Kodituwakku SR, Amarasinghe US (2013) Comparison of lossless data compression algorithms for text data. Indian J Comput Sci Eng 1(4):416\u2013426","journal-title":"Indian J Comput Sci Eng"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.jss.2011.11.1019","volume":"85","author":"YK Lin","year":"2012","unstructured":"Lin YK, Huang SC, Yang CH (2012) A fast algorithm for Huffman decoding based on a recursion Huffman tree. J Syst Softw 85(4):974\u2013980","journal-title":"J Syst Softw"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40535-016-0032-z","volume":"4","author":"A Habib","year":"2017","unstructured":"Habib A, Rahman MS (2017) Balancing decoding speed and memory usage for Huffman codes using quaternary tree. Appl Inform 4(1):1\u201315","journal-title":"Appl Inform"},{"issue":"12","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.3844\/jcssp.2018.1599.1610","volume":"14","author":"A Habib","year":"2018","unstructured":"Habib A, Islam MJ, Rahman MS (2018) Huffman based code generation algorithms: data compression perspectives. J Comput Sci 14(12):1599\u20131610","journal-title":"J Comput Sci"},{"key":"25_CR15","unstructured":"The Canterbury Corpus. \n                https:\/\/corpus.canterbury.ac.nz\/resources\/cantrbry.zip\n                \n              . Accessed 25 Jan 2019"},{"key":"25_CR16","unstructured":"The Brown Corpus. \n                https:\/\/ia800306.us.archive.org\/21\/items\/BrownCorpus\/brown.zip\n                \n              . Accessed 25 Jan 2019"},{"key":"25_CR17","unstructured":"The source code of Zopfli. \n                https:\/\/github.com\/google\/zopfli\n                \n              . Accessed 25 Jan 2019"},{"key":"25_CR18","unstructured":"The source code of Huffman algorithm. \n                https:\/\/www.geeksforgeeks.org\/greedy-algorithms-set-3-hufmancoding\/\n                \n              . Accessed 25 Jan 2019"}],"container-title":["Algorithms for Intelligent Systems","Proceedings of International Joint Conference on Computational Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3607-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T05:06:50Z","timestamp":1601356010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3607-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811536069","9789811536076"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3607-6_25","relation":{},"ISSN":["2524-7565","2524-7573"],"issn-type":[{"type":"print","value":"2524-7565"},{"type":"electronic","value":"2524-7573"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}