{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:37:00Z","timestamp":1763203020163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031199578"},{"type":"electronic","value":"9783031199585"}],"license":[{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T00:00:00Z","timestamp":1666310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-19958-5_82","type":"book-chapter","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T11:06:59Z","timestamp":1666264019000},"page":"863-873","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Encoding and\u00a0Decoding Technique to\u00a0Compress Huffman Tree Size in\u00a0an\u00a0Efficient Manner"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3910-2528","authenticated-orcid":false,"given":"Zinnia","family":"Sultana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9925-3363","authenticated-orcid":false,"given":"Lutfun","family":"Nahar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1726-0872","authenticated-orcid":false,"given":"Farzana","family":"Tasnim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7473-8185","authenticated-orcid":false,"given":"Mohammad Shahadat","family":"Hossain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0244-3561","authenticated-orcid":false,"given":"Karl","family":"Andersson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,21]]},"reference":[{"issue":"6","key":"82_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0020-0190(01)00243-5","volume":"81","author":"RA Chowdhury","year":"2002","unstructured":"Chowdhury, R.A., Kaykobad, M., King, I.: An efficient decoding technique for Huffman codes. Inf. Process. Lett. 81(6), 305\u2013308 (2002)","journal-title":"Inf. Process. Lett."},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Wang, P.C., Yang, Y.R., Lee, C.L., Chang, H.Y.: A memory-efficient Huffman decoding algorithm. In: 19th International Conference on Advanced Information Networking and Applications (AINA 2005) Volume 1 (AINA papers), vol. 2, pp. 475\u2013479. IEEE (2005)","DOI":"10.1109\/AINA.2005.33"},{"key":"82_CR3","doi-asserted-by":"crossref","unstructured":"Chen, B., Zhang, H.C., Cao, W.L., Feng, J.H.: Huffman coding method based on number character. In: 2007 International Conference on Machine Learning and Cybernetics, vol. 4, pp. 2296\u20132299. IEEE (2007)","DOI":"10.1109\/ICMLC.2007.4370528"},{"issue":"10","key":"82_CR4","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1109\/TCSVT.2008.920968","volume":"18","author":"SW Wang","year":"2008","unstructured":"Wang, S.W., Wu, J.L., Chuang, S.C., Hsiao, C.C., Tung, Y.S.: Memory efficient hierarchical lookup tables for mass arbitrary-side growing Huffman trees decoding. IEEE Trans. Circuits Syst. Video Technol. 18(10), 1335\u20131346 (2008)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"82_CR5","unstructured":"Seymour, L.: Theory and Problems of Data Structures. Mcgraw-Hill Book Company, pp. 249\u2013255 (2002)"},{"issue":"10","key":"82_CR6","doi-asserted-by":"publisher","first-page":"2576","DOI":"10.1109\/26.469442","volume":"43","author":"R Hashemian","year":"1995","unstructured":"Hashemian, R.: Memory efficient and high-speed search Huffman coding. IEEE Trans. Commun. 43(10), 2576\u20132581 (1995)","journal-title":"IEEE Trans. Commun."},{"key":"82_CR7","doi-asserted-by":"crossref","unstructured":"Chuang, Y.J., Wu, J.L.: An SGH-tree based efficient huffman decoding. In: Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint, vol. 3, pp. 1483\u20131487. IEEE (2003)","DOI":"10.1109\/ICICS.2003.1292713"},{"issue":"9","key":"82_CR8","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"4","key":"82_CR9","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1109\/18.335944","volume":"40","author":"R Schack","year":"1994","unstructured":"Schack, R.: The length of a typical Huffman codeword. IEEE Trans. Inf. Theory 40(4), 1246\u20131247 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"82_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(99)00002-2","volume":"69","author":"C Hong-Chung","year":"1999","unstructured":"Hong-Chung, C., Yue-Li, W., Yu-Feng, L.: A memory-efficient and fast Huffman decoding algorithm. Inf. Process. Lett. 69(3), 119\u2013122 (1999)","journal-title":"Inf. Process. Lett."},{"key":"82_CR11","doi-asserted-by":"crossref","unstructured":"Wu, Y., Wu, R., Ma, H., Wang, L., Su, J.: An Efficient Parallelized Huffman Decoding PE. In: 2021 3rd International Conference on Information Technology and Computer Communications, pp. 115\u2013119 (2021)","DOI":"10.1145\/3473465.3473485"},{"key":"82_CR12","series-title":"Algorithms for Intelligent Systems","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-981-15-3607-6_25","volume-title":"Proceedings of International Joint Conference on Computational Intelligence","author":"ML Rahman","year":"2020","unstructured":"Rahman, M.L., Sarker, P., Habib, A.: A faster decoding technique for huffman codes using adjacent distance array. In: Uddin, M.S., Bansal, J.C. (eds.) Proceedings of International Joint Conference on Computational Intelligence. AIS, pp. 309\u2013316. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-3607-6_25"},{"key":"82_CR13","doi-asserted-by":"crossref","unstructured":"Xezonakis, I.S., Leivadaros, S.: N-ary Huffman Encoding Using High-Degree Trees\u2013A Performance Comparison (2021). arXiv preprint arXiv:2105.07073","DOI":"10.5120\/ijca2021921315"},{"key":"82_CR14","unstructured":"Lakmali, D., Waidyarathna, U., De Silva, D., Sivapatham, S.: Fast Data Compression Using Huffman-Based Tree Structure (2020)"},{"key":"82_CR15","doi-asserted-by":"publisher","first-page":"190637","DOI":"10.1109\/ACCESS.2020.3031438","volume":"8","author":"RU Islam","year":"2020","unstructured":"Islam, R.U., Hossain, M.S., Andersson, K.: A deep learning inspired belief rule-based expert system. IEEE Access 8, 190637\u2013190651 (2020)","journal-title":"IEEE Access"},{"issue":"7","key":"82_CR16","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.3390\/s20071956","volume":"20","author":"S Kabir","year":"2020","unstructured":"Kabir, S., Islam, R.U., Hossain, M.S., Andersson, K.: An integrated approach of belief rule base and deep learning to predict air pollution. Sensors 20(7), 1956 (2020)","journal-title":"Sensors"},{"key":"82_CR17","doi-asserted-by":"crossref","unstructured":"Abedin, M.Z., Nath, A.C., Dhar, P., Deb, K., Hossain, M.S.: License plate recognition system based on contour properties and deep learning model. In 2017 IEEE Region 10 Humanitarian Technology Conference (R10-HTC), pp. 590\u2013593. IEEE (2017)","DOI":"10.1109\/R10-HTC.2017.8289029"},{"key":"82_CR18","doi-asserted-by":"crossref","unstructured":"Ahmed, T.U., Jamil, M.N., Hossain, M.S., Andersson, K., Hossain, M.S.: An integrated real-time deep learning and belief rule base intelligent system to assess facial expression under uncertainty. In: 2020 Joint 9th International Conference on Informatics, Electronics & Vision (ICIEV) and 2020 4th International Conference on Imaging, Vision & Pattern Recognition (icIVPR), pp. 1\u20136. IEEE (2020)","DOI":"10.1109\/ICIEVicIVPR48672.2020.9306622"},{"key":"82_CR19","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-981-33-4673-4_29","volume-title":"Proceedings of International Conference on Trends in Computational and Cognitive Engineering","author":"E Hossain","year":"2021","unstructured":"Hossain, E., Shariff, M.A.U., Hossain, M.S., Andersson, K.: A novel deep learning approach to\u00a0predict air quality index. In: Kaiser, M.S., Bandyopadhyay, A., Mahmud, M., Ray, K. (eds.) Proceedings of International Conference on Trends in Computational and Cognitive Engineering. AISC, vol. 1309, pp. 367\u2013381. Springer, Singapore (2021). https:\/\/doi.org\/10.1007\/978-981-33-4673-4_29"},{"issue":"4","key":"82_CR20","first-page":"18","volume":"9","author":"MS Hossain","year":"2019","unstructured":"Hossain, M.S., Tuj-Johora, F., Andersson, K.: A belief rule based expert system to assess hypertension under uncertainty. J. Internet Serv. Inf. Secur. (JISIS) 9(4), 18\u201338 (2019)","journal-title":"J. Internet Serv. Inf. Secur. (JISIS)"},{"key":"82_CR21","doi-asserted-by":"publisher","unstructured":"Ahmed, T.U., Jamil, M.N., Hossain, M.S., Islam, R.U., Andersson, K.: An integrated deep learning and belief rule base intelligent system to predict survival of COVID-19 patient under uncertainty. Cogn. Comput. 1\u201317 (2021). https:\/\/doi.org\/10.1007\/s12559-021-09978-8","DOI":"10.1007\/s12559-021-09978-8"},{"issue":"7","key":"82_CR22","doi-asserted-by":"publisher","first-page":"213","DOI":"10.3390\/a14070213","volume":"14","author":"SN Zisad","year":"2021","unstructured":"Zisad, S.N., Chowdhury, E., Hossain, M.S., Islam, R.U., Andersson, K.: An integrated deep learning and belief rule-based expert system for visual sentiment analysis under uncertainty. Algorithms 14(7), 213 (2021)","journal-title":"Algorithms"},{"key":"82_CR23","doi-asserted-by":"crossref","unstructured":"Kabir, S., Islam, R.U., Hossain, M.S., Andersson, K.: An integrated approach of Belief Rule Base and Convolutional Neural Network to monitor air quality in Shanghai. Expert Syst. Appl. 206, 117905 (2022)","DOI":"10.1016\/j.eswa.2022.117905"}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing & Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19958-5_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T07:13:34Z","timestamp":1728198814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19958-5_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,21]]},"ISBN":["9783031199578","9783031199585"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19958-5_82","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022,10,21]]},"assertion":[{"value":"21 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hua Hin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icico.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}