Application of Discrete Structures and Numerical Sequences in Block Codes

Authors

  • Руслан Вячеславович Скуратовський Taras Shevchenko National University of Kyiv., Ukraine
  • Ольга Ігорівна Трембовецька NTUU KPI, Ukraine

DOI:

https://doi.org/10.20535/1810-0546.2014.6.57754

Keywords:

Code, Algorithm, Archiving, Encryption

Abstract

The purpose to compress information using composition of universal codes with the recursive algorithm of original data recovery was achieved in this work. It obtains compression coefficient higher than in symbolic coding. Proposed method of time coding has reasonable values of compression coefficient and its purpose is coding with compression. For this purpose, entirely new kind of universal coding with the polybasic numeral system was created. The presented method is subtype of universal codes and has an advantage over the Huffman coding for compression, because there is no need to know the exact probability distribution that gives us the characters in the initial data stream and it is a subspecies of the universal coding. The Huffman coding requires exact probability distribution. But when we talk about universal coding it is sufficient to know only the relative order of these probabilities (symbol, are more often, the second of the most common symbol, etc.) withal. Created coding method can be applied in mobile communication and in means of closed communication, if it will be used with block codes, which doesn’t scatter symbol frequencies, because it meets modern requirements for cyphering.

 

Author Biographies

Руслан Вячеславович Скуратовський, Taras Shevchenko National University of Kyiv.

Skuratovskii Ruslan V., junior research fellow  

Ольга Ігорівна Трембовецька, NTUU KPI

Trembovetska Olha I., student

References

S. Ristov and E. Laporte, “Ziv lempl compression of huge natural languadge data tries using suffix arrays”, 10th Annual Symp. ACM. Experimentation, Combinatorial Pattern Matching, UK, Warwick University, M. Crochemore and M. Paterson, eds. Berlin: Springer, 1999, pp. 196–211.

Методы сжатия без потерь / Д. Ватолин, А. Ратушняк, М. Смирнов, В. Юкин. – М.: Диалог-МИФИ, 2002. – 384 с.

K. Sayood, Introduction to Data Compression, 3rd ed., Morgan Kaufman, 2006, p. 315.

Скуратовский Р.В. Метод быстрого таймерного кодирования текстов // Кибернетика и системный анализ. – 2013. – № 1. – С. 154–160.

H. Yamamoto, “A new recursive universal code of the positive integers”, IEEE Trans. Inform. Theory, vol. 46, pp. 717–723, 2000.

Скуратовський Р. В. Комбінована λ, V-адична система числення і деякі математичні об’єкти, які з нею пов’язані // Студентскі фіз.-мат етюди. – 2003. – С. 45–50.

Стахов А.П. Коды золотой пропорции. – М.: Радио и связь, 1994. – 152 с.

Downloads

Published

2014-12-26

Issue

No. 6 (2014): Engineering

Section

Art

License

Copyright (c) 2017 NTUU KPI Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under CC BY 4.0 that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work