Speeding up binomial compression based on binary binomial numbers
DOI:
https://doi.org/10.15587/1729-4061.2025.335729Keywords:
adaptive compression, binomial numbers, coding selection, binomial-vector method, compression timeAbstract
This study's object is adaptive compression of general-form binary sequences based on binary binomial numbers.
The task addressed is to enable high compression speed of binary information based on binomial numbers under the condition of uncertainty in the characteristics of the binary sequences being compressed.
One of the factors that reduce the efficiency of binomial compression is uncontrolled transitions of the number of unit combinations to the region of inefficient use, the worst compression ratios.
In this regard, the work applies an adaptive approach to binomial compression, based on the choice of an encoding technique depending on the number of units of the processed sequence.
This approach yields the following result: a several-fold reduction in the amount of time spent processing binary combinations that are not compressible. Consequently, this leads to an increase in the average speed of binomial compression with a small, up to three to five percent, decrease in the compression ratio.
The adaptive compression process model includes the stages of comparing the calculated numbers of binary units with the compression conditions and selecting the coding technique based on binary binomial numbers. If the current value of the number of units goes beyond the compression conditions, the calculation of the number of units is stopped, and the processed sequence remains unchanged. This eliminates unnecessary time costs when the compression ratio becomes less than unity.
In practice, the adaptive approach to compression based on binary binomial numbers is effective in the case when the binary sequences being compressed have uncertain characteristics, and their preliminary evaluation is impossible or difficult
References
- Jerzy, S. A. (2013). Information Systems and Data Compression. Springer, 494. https://doi.org/10.1007/978-0-585-27999-2_6
- Routray, S. K., Javali, A., Sharmila, K. P., Semunigus, W., Pappa, M., Ghosh, A. D. (2020). Lossless Compression Techniques for Low Bandwidth Networks. 2020 3rd International Conference on Intelligent Sustainable Systems (ICISS), 823–828. https://doi.org/10.1109/iciss49785.2020.9315936
- Salomon, D. (2010). Handbook of Data Compression. Springer, 1383. https://doi.org/10.1007/978-1-84882-903-9
- Li, Z.-N., Drew, M. S., Liu, J. (2021). Fundamentals of Multimedia. Springer International Publishing Switzerland, 824. https://doi.org/10.1007/978-3-030-62124-7
- Duda, J., Tahboub, K., Gadgil, N. J., Delp, E. J. (2015). The use of asymmetric numeral systems as an accurate replacement for Huffman coding. 2015 Picture Coding Symposium (PCS), 65–69. https://doi.org/10.1109/pcs.2015.7170048
- Mrudula, S. T., Srinivasa Murthy, K. E., Prasad, M. N. G. (2022). Optimized Context-Adaptive Binary Arithmetic Coder in Video Compression Standard Without Probability Estimation. Mathematical Modelling of Engineering Problems, 9 (2), 458–462. https://doi.org/10.18280/mmep.090222
- Stakhov, A. (2016). Fibonacci p-codes and Codes of the “Golden” p-proportions: New Informational and Arithmetical Foundations of Computer Science and Digital Metrology for Mission-Critical Applications. British Journal of Mathematics & Computer Science, 17 (1), 1–49. https://doi.org/10.9734/bjmcs/2016/25969
- Borysenko, O. A., Horiachev, O. Ye., Serdiuk, V. V., Yermakov, M. S. (2018). Information protection problems of factorial numbers. Ukrainian Scientific Journal of Information Security, 24 (3), 169–174. https://doi.org/10.18372/2225-5036.24.13069
- Borysenko, O., Matsenko, S., Bobrovs, V. (2021). Binomial Number System. Applied Sciences, 11 (23), 11110. https://doi.org/10.3390/app112311110
- Luzhetskyi, V. A., Savytska, L. A. (2015). Development and research of adaptive data compression methods based on linear fibonacci form. Eastern-European Journal of Enterprise Technologies, 1 (9 (73)), 16–22. https://doi.org/10.15587/1729-4061.2015.37026
- Borysenko, A. A. (2004). Bynomyalnii schet. Teoryia y praktyka. Sumi: YTD «Unyversytetskaia knyha», 170. Available at: https://essuir.sumdu.edu.ua/handle/123456789/55161
- Borisenko, A. A., Kulik, I. A. (2010). Binomialnoe kodirovanie. Sumy: Izd-vo SumGU, 206.
- Schalkwijk, J. (1972). An algorithm for source coding. IEEE Transactions on Information Theory, 18 (3), 395–399. https://doi.org/10.1109/tit.1972.1054832
- Cover, T. (1973). Enumerative source encoding. IEEE Transactions on Information Theory, 19 (1), 73–77. https://doi.org/10.1109/tit.1973.1054929
- Butler, J. T., Sasao, T. (2011). Fast constant weight codeword to index converter. 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS), 1–4. https://doi.org/10.1109/mwscas.2011.6026312
- Borysenko, O., Matsenko, S., Salgals, T., Spolitis, S., Bobrovs, V. (2022). The Lossless Adaptive Binomial Data Compression Method. Applied Sciences, 12 (19), 9676. https://doi.org/10.3390/app12199676
- Kulyk, I., Berezhna, O., Shevchenko, M. (2018). Development of data compressing coding methods on basis of binary binomial numbers. Technology Audit and Production Reserves, 2 (2 (46)), 12–18. https://doi.org/10.15587/2312-8372.2019.169897
- Kulyk, Y. A., Novhorodtsev, A. Y., Shevchenko, M. S. (2019). Method for borders estimation of compression on basis of binary binomial numbers. Systemy obrobky informatsii, 2 (157), 57–62. https://doi.org/10.30748/soi.2019.157.07
- Reingold, M. E., Nievegelt, J., Deo, N. (1977). Combinatorial Algorithms: Theory and Practice. Pearson College Div, 930.
- Kulyk, Y. A. (2004). O srednei dlyne dvoychnikh bynomyalnikh chysel. Visnyk Sumskoho derzhavnoho universytetu. Seriia «Tekhnichni nauky», 12 (71), 106–112.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Igor Kulyk, Maryna Shevchenko, Vitalii Grynenko, Maksim Hermes
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.
