{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:51:04Z","timestamp":1760233864423,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T00:00:00Z","timestamp":1614816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>There is always an increasing demand for data storage and transfer; therefore, data compression will always be a fundamental need. In this article, we propose a lossless data compression method focused on a particular kind of data, namely, chat messages, which are typically non-formal, short-length strings. This method can be considered a hybrid because it combines two different algorithmic approaches: greedy algorithms, specifically Huffman coding, on the one hand and dynamic programming on the other (HCDP = Huffman Coding + Dynamic Programming). The experimental results demonstrated that our method provided lower compression ratios when compared with six reference algorithms, with reductions between 23.7% and 39.7%, whilst the average remained below the average value reported in several related works found in the literature. Such performance carries a sacrifice in speed, however, which does not presume major practical implications in the context of short-length strings.<\/jats:p>","DOI":"10.3390\/computers10030028","type":"journal-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T21:58:07Z","timestamp":1614895087000},"page":"28","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5765-9947","authenticated-orcid":false,"given":"Juli\u00e1n","family":"Moreno Cadavid","sequence":"first","affiliation":[{"name":"Departamento de Ciencias de la Computaci\u00f3n y Decisi\u00f3n (Medell\u00edn), Universidad Nacional de Colombia\u2014Sede Medell\u00edn, Medell\u00edn 050036, Colombia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5662-9663","authenticated-orcid":false,"given":"Hern\u00e1n Dar\u00edo","family":"Vanegas Madrigal","sequence":"additional","affiliation":[{"name":"Departamento de Ciencias de la Computaci\u00f3n y Decisi\u00f3n (Medell\u00edn), Universidad Nacional de Colombia\u2014Sede Medell\u00edn, Medell\u00edn 050036, Colombia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,3,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Wade, G. (1994). Signal Coding and Processing, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9781139170314"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Pu, I.M. (2006). Fundamental Data Compression, Butterworth-Heinemann.","DOI":"10.1016\/B978-075066310-6\/50013-1"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Sayood, K. (2006). Introduction to Data Compression, Morgan Kaufmann. [3rd ed.].","DOI":"10.1016\/B978-012620862-7\/50001-8"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Salomon, D., and Motta, G. (2010). Handbook of Data Compression, Springer. [5th ed.].","DOI":"10.1007\/978-1-84882-903-9"},{"key":"ref_5","first-page":"142","article-title":"Data compression methodologies for lossless data and comparison between algorithms","volume":"2","author":"Porwal","year":"2013","journal-title":"Int. J. Eng. Sci. Innov. Technol."},{"key":"ref_6","first-page":"1999","article-title":"A Survey on different text data compression techniques","volume":"3","author":"Singh","year":"2014","journal-title":"Int. J. Sci. Res. (IJSR)"},{"key":"ref_7","first-page":"383","article-title":"Lossless data compression techniques and comparison between the algorithms","volume":"2","author":"Singh","year":"2015","journal-title":"Int. Res. J. Eng. Technol."},{"key":"ref_8","first-page":"119","article-title":"A survey on data compression techniques: From the perspective of data quality, coding schemes, data type and applications","volume":"33","author":"Uthayakumar","year":"2018","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hamdan, S., Awaian, A., and Almajali, S. (2019, January 9\u201311). Compression Techniques Used in IoT: A Comparitive Study. Proceedings of the 2019 2nd International Conference on new Trends in Computing Sciences (ICTCS), Amman, Jordan.","DOI":"10.1109\/ICTCS.2019.8923112"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10207-018-0424-2","article-title":"Breaking MPC implementations through compression","volume":"18","author":"Resende","year":"2019","journal-title":"Int. J. Inf. Secur."},{"key":"ref_11","unstructured":"Goode, L. (2021, February 04). Messenger and WhatsApp Process 60 Billion Messages a Day, Three Times More Than SMS. The Verge, Available online: https:\/\/www.theverge.com\/2016\/4\/12\/11415198\/facebook-messenger-whatsapp-number-messages-vs-sms-f8-2016."},{"key":"ref_12","first-page":"92","article-title":"Oralization of digital texts: Non-normative uses in written online conversations","volume":"2","author":"Holgado","year":"2013","journal-title":"Caracteres"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1111\/1467-9817.00150","article-title":"Teenagers in cyberspace: An investigation of language use and language change in internet chatrooms","volume":"24","author":"Merchant","year":"2001","journal-title":"J. Res. Read."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"O\u2019Neill, J., and Martin, D. (2003). Text Chat in Action. Proceedings of the 2003 International ACM SIGGROUP Conference on Supporting Group Work, Association for Computing Machinery.","DOI":"10.1145\/958160.958167"},{"key":"ref_15","unstructured":"Zinman, A., and Donath, J. (2009, January 5\u20138). Signs: Increasing Expression and Clarity in Instant Messaging. Proceedings of the 2009 42nd Hawaii International Conference on System Sciences, Waikoloa, HI, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Taiwo, R. (2010). Handbook of Research on Discourse Behavior and Digital Communication: Language Structures and Social Interaction, IGI Global. Volume I, II, Information Science Reference.","DOI":"10.4018\/978-1-61520-773-2"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yus, F. (2011). Cyberpragmatics: Internet-Mediated Communication in Context, John Benjamins Publishing Company.","DOI":"10.1075\/pbns.213"},{"key":"ref_18","unstructured":"Pritzker, S., and Runco, M. (2020). Technology: Creativity in Chats. Encyclopedia of Creativity, Academic Press. [3rd ed.]."},{"key":"ref_19","first-page":"61","article-title":"Marcas fon\u00e9ticas de la oralidad en la lengua de los chats","volume":"5","author":"Llisterri","year":"2002","journal-title":"Rev. Investig. Ling\u00fc\u00edst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Xiao, Z., Guo, L., and Tracey, J. (2007, January 25\u201327). Understanding instant messaging traffic characteristics. Proceedings of the 27th International Conference on Distributed Computing Systems, Toronto, ON, Canada.","DOI":"10.1109\/ICDCS.2007.149"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-Redundancy Codes","volume":"40","author":"Huffman","year":"1952","journal-title":"Proc. IRE"},{"key":"ref_22","unstructured":"Rein, S., Clemens, G., and Fitzek, F.H.P. (2006, January 28\u201330). Low-Complexity Compression of Short Messages. Proceedings of the Data Compression Conference (DCC), Snowbird, UT, USA."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.camwa.2007.05.014","article-title":"An adaptive character wordlength algorithm for data compression","volume":"55","author":"Hussain","year":"2008","journal-title":"Comput. Math. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Brisaboa, N., Fari\u00f1a, A., Navarro, G., and Param\u00e1, J. (2010). Dynamic Lightweight Text Compression. ACM Trans. Inf. Syst., 28.","DOI":"10.1145\/1777432.1777433"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.4304\/jcp.5.1.49-58","article-title":"An Enhanced Short Text Compression Scheme for Smart Devices","volume":"5","author":"Islam","year":"2010","journal-title":"J. Comput."},{"key":"ref_26","first-page":"2","article-title":"Compressed chatting over internet","volume":"106","author":"Sonawane","year":"2014","journal-title":"Int. J. Comput. Appl."},{"key":"ref_27","first-page":"11","article-title":"A hybrid technique for data compression","volume":"9","author":"Mohamed","year":"2015","journal-title":"Int. J. Digit. Content Technol. Appl."},{"key":"ref_28","first-page":"1273","article-title":"Lossless text data compression using modified Huffman coding","volume":"5","author":"Harsimran","year":"2015","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.csi.2014.05.005","article-title":"Rapid lossless compression of short text messages","volume":"37","author":"Kalajdzic","year":"2015","journal-title":"Comput. Stand. Interfaces"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"3607","DOI":"10.3906\/elk-1601-92","article-title":"A new word-based compression model allowing compressed pattern matching","volume":"25","author":"Bulus","year":"2017","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Brass, P. (2008). Advanced Data Structures, Cambridge University Press.","DOI":"10.1017\/CBO9780511800191"},{"key":"ref_32","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, MIT Press. [3rd ed.]."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/3\/28\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:32:36Z","timestamp":1760160756000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/3\/28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,4]]},"references-count":32,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,3]]}},"alternative-id":["computers10030028"],"URL":"https:\/\/doi.org\/10.3390\/computers10030028","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2021,3,4]]}}}