{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:26:12Z","timestamp":1775633172027,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Information and Communication Technology Division, Government of People\u2019s Republic of Bangladesh","award":["56.00.0000.028.33.025.14-153,"],"award-info":[{"award-number":["56.00.0000.028.33.025.14-153,"]}]},{"name":"Information and Communication Technology Division, Government of People\u2019s Republic of Bangladesh"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Iran J Comput Sci"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s42044-019-00047-w","type":"journal-article","created":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T05:55:03Z","timestamp":1567835703000},"page":"127-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A dictionary-based text compression technique using quaternary code"],"prefix":"10.1007","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9320-4456","authenticated-orcid":false,"given":"Ahsan","family":"Habib","sequence":"first","affiliation":[]},{"given":"M. Jahirul","family":"Islam","sequence":"additional","affiliation":[]},{"given":"Mohammad Shahidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,7]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Khuri, S., Hsu, H-C.: Tools for visualizing text compression algorithms. In: Proceedings of the 2000 ACM Symposium on Applied Computing (SAC\u201900), Como, Italy, March 2000, vol. 1, pp. 119\u2013123 (2000)","DOI":"10.1145\/335603.335716"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Huffman, DA.: A method for construction of minimum redundancy codes. In: Proceedings of the IRE, Sep 1952, vol. 40, pp. 1090\u20131101 (1952)","DOI":"10.1109\/JRPROC.1952.273898"},{"issue":"5","key":"47_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.3923\/itj.2010.1013.1021","volume":"9","author":"A Carus","year":"2010","unstructured":"Carus, A., Mesut, A.: Fast text compression using multiple static dictionaries. Inf. Technol. J. 9(5), 1013\u20131021 (2010). \nhttps:\/\/doi.org\/10.3923\/itj.2010.1013.1021","journal-title":"Inf. Technol. J."},{"issue":"3","key":"47_CR4","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 Trans. Inf. Theory 23(3), 337\u2013343 (1977). \nhttps:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"47_CR5","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 sequence via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978). \nhttps:\/\/doi.org\/10.1109\/TIT.1978.1055934","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"47_CR6","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982). \nhttps:\/\/doi.org\/10.1145\/322344.322346","journal-title":"J. ACM"},{"issue":"6","key":"47_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MC.1984.1659158","volume":"17","author":"TA Welch","year":"1984","unstructured":"Welch, T.A.: A technique for high-performance data compression. Computer 17(6), 8\u201319 (1984). \nhttps:\/\/doi.org\/10.1109\/MC.1984.1659158","journal-title":"Computer"},{"issue":"5","key":"47_CR8","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/j.ipm.2004.08.009","volume":"41","author":"A Moffat","year":"2005","unstructured":"Moffat, A., Isal, R.Y.K.: Word-based text compression using the Burrows\u2013Wheeler transform. Inf. Process. Manag. 41(5), 1175\u20131192 (2005). \nhttps:\/\/doi.org\/10.1016\/j.ipm.2004.08.009","journal-title":"Inf. Process. Manag."},{"key":"47_CR9","unstructured":"L\u2019ansk\u2019y, J., \u017demli\u010dka, M.: Text compression: syllables. In: Proceedings of the Dateso\u2013Workshop on Databases, Texts, Specifications and Objects, Desna, Czech Republic, April 13\u201315, 2005, pp. 32\u201345 (2005)"},{"key":"47_CR10","unstructured":"Adiego, J., de la Feunte, P.: On the use of words as source alphabet symbols in PPM. In: Proceedings of Data Compression Conference, Snowbird, UT, USA, March 28\u201330, 2006, pp. 435 (2006)"},{"key":"47_CR11","unstructured":"Dvorsky, J., Pokorny, J., Snasel, V.: Word-based compression methods for large text documents. In: Proceedings of Data Compression Conference, Snowbird, UT, USA, March 29\u201331, 1999, pp. 523 (1999)"},{"key":"47_CR12","unstructured":"L\u2019ansk\u2019y, J., \u017demli\u010dka, M.: Compression of a dictionary. In: Proceedings of DATESO Workshop on Databases, Texts, Specifications and Objects, Desna, Czech Republic, April 26\u201328, 2006, pp. 11\u201320 (2006)"},{"key":"47_CR13","unstructured":"Al-Bahadili, H., Rababa, A.: An adaptive bit-level text compression scheme based on the HCDC algorithm. In: Proceedings of Mosharaka International Conference on Communications, Networking and Information Technology, Amman, Jordan, Dec 6\u20138, 2007, pp. 51\u201356 (2007)"},{"issue":"2","key":"47_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00204-9","volume":"61","author":"KL Chung","year":"1997","unstructured":"Chung, K.L.: Efficient Huffman decoding. Inf. Process. Lett. 61(2), 97\u201399 (1997). \nhttps:\/\/doi.org\/10.1016\/S0020-0190(96)00204-9","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"47_CR15","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). \nhttps:\/\/doi.org\/10.1109\/18.335944","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"47_CR16","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1976.1055554","volume":"22","author":"GOH Katona","year":"1978","unstructured":"Katona, G.O.H., Nemetz, T.O.H.: Huffman codes and self-information. IEEE Trans. Inf. Theory 22(3), 337\u2013340 (1978). \nhttps:\/\/doi.org\/10.1109\/TIT.1976.1055554","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\/3\/4","key":"47_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/26.380027","volume":"43","author":"PM Fenwick","year":"1995","unstructured":"Fenwick, P.M.: Huffman code efficiencies for extensions of sources. IEEE Trans. Commun. 43(2\/3\/4), 163\u2013165 (1995)","journal-title":"IEEE Trans. Commun."},{"issue":"7","key":"47_CR18","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TCAD.2008.923100","volume":"27","author":"X Kavousianos","year":"2008","unstructured":"Kavousianos, X., Kalligeros, E., Nikolos, D.: Test-data compression based on variable-to-variable huffman encoding with codeword reusability. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(7), 1333\u20131338 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.jss.2011.11.1019","volume":"85","author":"Y-K Lin","year":"2012","unstructured":"Lin, Y.-K., Huang, S.-C., Yang, C.-H.: A fast algorithm for Huffman decoding based on a recursion Huffman tree. J. Syst. Softw. 85, 974\u2013980 (2012)","journal-title":"J. Syst. Softw."},{"key":"47_CR20","unstructured":"Alakuijala, J., Vandevenne, L.: Data compression using Zopfli. Google Inc. [Online]. \nhttps:\/\/zopfli.googlecode.com\/files\/Data_compression_using_Zopfli.pdf\n\n. Accessed 30 May 2018 (2013)"},{"key":"47_CR21","unstructured":"The Brown Corpus [Online]. \nhttp:\/\/www.nltk.org\/nltk_data\/\n\n. Accessed 30 May (2018)"},{"key":"47_CR22","unstructured":"The Canterbury Corpus [Online]. \nhttp:\/\/corpus.canterbury.ac.nz\/resources\/cantrbry.zip\n\n. Accessed 30 May (2018)"},{"issue":"2","key":"47_CR23","first-page":"46","volume":"16","author":"MAA Mumin","year":"2012","unstructured":"Mumin, M.A.A., Shoeb, A.A.M., Selim, M.R., Iqbal, M.Z.: SUPara: a balanced english-bengali parallel corpus. SUST J. Sci. Technol. 16(2), 46\u201351 (2012)","journal-title":"SUST J. Sci. Technol."},{"key":"47_CR24","unstructured":"The Enwik8 Corpus [Online]. \nhttp:\/\/mattmahoney.net\/dc\/text.html\n\n\nhttp:\/\/mattmahoney.net\/dc\/enwik8.zip\n\n. Accessed 30 May 2018"},{"key":"47_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s40535-016-0032-z","volume":"4","author":"A Habib","year":"2017","unstructured":"Habib, A., Rahman, M.S.: Balancing decoding speed and memory usage for Huffman codes using quaternary tree. Appl. Inf. 4, 5 (2017). \nhttps:\/\/doi.org\/10.1186\/s40535-016-0032-z","journal-title":"Appl. Inf."},{"key":"47_CR26","unstructured":"Zopfli Source Code [Online]. \nhttps:\/\/github.com\/google\/zopfli\/commit\/89cf773beef75d7f4d6d378debdf299378c3314e\n\n. Accessed 30 May 2018"},{"key":"47_CR27","unstructured":"LZHAM Source [Online]. \nhttps:\/\/github.com\/richgel999\/lzham_codec\n\n. Accessed 30 May (2018)"},{"key":"47_CR28","unstructured":"bzip2 Source: bzip2 1.0.6 6-Sept-2010 [Online]. \nhttps:\/\/github.com\/enthought\/bzip2-1.0.6\n\n. Accessed 30 May 2018"},{"key":"47_CR29","unstructured":"LZMA Source: LZMA implementation in 7zip 9.20.1 [Online]. LZMA SDK: \nhttps:\/\/www.7-zip.org\/sdk.htm\n\n. Accessed 30 May 2018"},{"key":"47_CR30","doi-asserted-by":"crossref","unstructured":"Deutsch P (1996) RFC 1952\u2014GZIP file format specification, version 4.3, May 1996. [Online]. \nhttp:\/\/www.ietf.org\/rfc\/rfc1952.txt\n\n. Accessed 30 May (2018)","DOI":"10.17487\/rfc1952"}],"container-title":["Iran Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-019-00047-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42044-019-00047-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42044-019-00047-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T18:08:18Z","timestamp":1599502098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42044-019-00047-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,7]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s42044-019-00047-w","relation":{},"ISSN":["2520-8438","2520-8446"],"issn-type":[{"value":"2520-8438","type":"print"},{"value":"2520-8446","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,7]]},"assertion":[{"value":"24 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}