JCEEES
Journal of Computer & Electrical and Electronics Engineering Sciences

JCEEES aims to publish original articles covering the theoretical foundations of major computer, electronic and electrical engineering sciences, as well as academic, commercial and educational aspects that propose new ideas for the application and design of artificial intelligence, software and information systems. In addition to wide-ranging regular topics, JCEEES also makes it a principle to include special topics covering specific topics in all areas of interest mainly in computational medicine, artificial intelligence, computer science, and electrical & electronic engineering science.

eISSN: 2980-177X
Creative Commons CC BY-NC-ND 4.0 International License.

Online Manuscript System

Index
Original Article
Application and performance evaluation of the dynamic bit-level encoding algorithm (DEA) in text compression: a cross-domain perspective
Abstract
The exponential growth of digital data has heightened the need for efficient, lossless compression techniques to improve storage and transmission performance. This study investigates the applicability of the dynamic bit-level encoding algorithm (DEA), originally designed for image compression, to text compression. DEA employs a dynamic, frequency-based bit-level coding scheme that models inter-character relationships and constructs two-level Huffman trees for high- and low-frequency character groups. Unlike conventional algorithms such as Huffman, LZ77, and LZ78, DEA adapts its coding structure to local data patterns, aiming to enhance compression efficiency across heterogeneous text datasets. Experiments were conducted on nine datasets-including plain text, SQL queries, and HTML documents-using compression ratio (CR) and space saving (SS) as evaluation metrics. DEA achieved an average CR of 2.72 and SS of 62%, outperforming Huffman (1.87 CR, 43% SS), LZ77 (1.67 CR, 30% SS), and LZ78 (1.73 CR, 14% SS) across all datasets. These results demonstrate DEA’s robustness and adaptability to diverse text structures. The findings suggest DEA as a practical alternative for applications requiring high-efficiency, lossless compression, such as archival systems, log management, messaging protocols, and real-time data transmission. Future work will focus on memory optimization, parallelization for large-scale applications, and integration into hybrid compression frameworks.

Keywords : Text compression, lossless compression, dynamic encoding algorithm, cross-domain compression

Download Article


1. Beemkumar, N., Riyat, S., & Kumar, D. (2024). An Investigation of Lossless and Lossy Data Compression & Source Coding. 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT), 1-6. https://doi.org/10.1109/ICCCNT61001.2024.10725458
2. Dhulavvagol, P. M., Gadagkar, A., Kj, A., Hegade, G., Poonia, R., & Totad, S. G. (2024). Lossless text compression using recurrent neural networks. Procedia Computer Science, 235, 3340-3349. https://doi.org/ 10.1016/j.procs.2024.04.315
3. Erdal, E., & Önal, A. (2025). Enhanced framework for lossless image compression using image segmentation and a novel dynamic bit-level encoding algorithm. Applied Sciences, 15(6), 2964. https://doi.org/10. 3390/app15062964
4. Gastón, B., Pujol, J., & Villanueva, M. (2013). A realistic distributed storage system that minimizes data storage and repair bandwidth (Versiyon 1). arXiv. https://doi.org/10.48550/ARXIV.1301.1549
5. Gopinath, A., & Ravisankar, M. (2020). Comparison of lossless data compression techniques. 2020 International Conference on Inventive Computation Technologies (ICICT), 628-633. https://doi.org/10.1109/ICICT48043.2020.9112516
6. Gupta, A., Bansal, A., & Khanduja, V. (2017). Modern lossless compression techniques: review, comparison and analysis. 2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT), 1-8. https://doi.org/10.1109/ICECCT.2017.8117850
7. Hoffman, R. (1997). Compression Algorithms for Symbolic Data. In; R. Hoffman, Data Compression in Digital Systems (ss. 53-74). Springer US. https://doi.org/10.1007/978-1-4615-6031-9_4
8. Huffman, D. (1952). A method for the construction of minimum-redundancy codes. Proceedings of the IRE, 40(9), 1098-1101. https://doi.org/10.1109/JRPROC.1952.273898
9. KeskiN, S., Sevli, O., & Okatan, E. (2023). Single and binary performance comparison of data compression algorithms for text files. Bitlis Eren Üniversitesi Fen Bilimleri Dergisi, 12(3), 783-796. https://doi.org/10. 17798/bitlisfen.1301546
10. Welch. (1984). A technique for high-performance data compression. Computer, 17(6), 8-19. https://doi.org/10.1109/MC.1984.1659158
11. Ziv, J., & Lempel, A. (1977). A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(3), 337-343. https://doi.org/10.1109/TIT.1977.1055714
12. Ziv, J., & Lempel, A. (1978). Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5), 530-536. https://doi.org/10.1109/TIT.1978.1055934
Article available in :
Volume 4, Issue 1, 2026
Page : 1-8
https://doi.org/10.51271/JCEEES-0031
Article Information
Received : 15 Ağu 2025
Accepted : 04 Eyl 2025
Published : 25 Nis 2026
Corresponding Author :

Alperen Önal: Department of Computer Engineering, Faculty of Engineering and Natural Sciences, Kırıkkale University, Kırıkkale, Turkiye

[email protected]
Citation : Erdal, E., Ergüzen, A., & Önal, A. (2026). Application and performance evaluation of the dynamic bit-level encoding algorithm (DEA) in text compression: a cross-domain perspective. J Comp Electr Electron Eng Sci, 4(1), 1-8.

Read: 53
Download : 44
Cited: 0
_Footer