: 99-105
Received: May 11, 2021
Accepted: June 01, 2021
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine
Lviv Polytechnic National University, Lviv, Ukraine

Comparative analysis of the effectiveness of monolithic and cyclic noise protective codes built on "Ideal Ring Bundles" (IRBs) as the common theoretical basis for synthesis, researches and application of the codes for improving technical indexes of coding systems with respect to performance, reliability, transformation speed, and security has been realized. IRBs are cyclic sequences of positive integers, which form perfect partitions of a finite interval of integers. Sums of connected IRB elements enumerate the natural integers set exactly R-times. The IRB-codes both monolithic and cyclic ones forming on the underlying combinatorial constructions can be used for finding optimal solutions for configure of an applicable coding systems based on the common mathematical platform. The mathematical model of noise-protective data coding systems presents remarkable properties of harmonious developing real space. These properties allow configure codes with useful possibilities. First of them belong to the self-correcting codes due to monolithic arranged both symbols "1" and of course "0" of each allowed codeword. This allows you to automatically detect and correct errors by the monolithic structure of the encoded words. IRB codes of the second type provide improving noise protection of the codes by choosing the optimal ratio of information parameters. As a result of comparative analysis of cyclic IRB-codes based with optimized parameters and monolithic IRB-codes, it was found that optimized cyclic IRB codes have an advantage over monolithic in relation to a clearly fixed number of detected and corrected codes, while monolithic codes favorably differ in the speed of message decoding due to their inherent properties of self-correction and encryption. Monolithic code characterized by packing of the same name characters in the form of solid blocks. The latter are capable of encoding data on several levels at the same time, which expands the ability to encrypt and protect encoded data from unauthorized access. Evaluation of the effectiveness of coding optimization methods by speed of formation of coding systems, method power, and error correcting has been made. The model based on the combinatorial configurations contemporary theory, which can find a wide scientific field for the development of fundamental and applied researches into information technolodies, including application multidimensional models, as well as algorithms for synthesis of the underlying models.

[1]     BCH code. (2020). From Wikipedia. The Free Encyclopedia. Retrieved from:

[2]     Blahut, R. E. (1986). Theory and Practice of Error Control Codes. Moscow: Mir, 576 p. [In Russian].

[3]     Error correction code. (2021). Wikipedia. The Free Encyclopedia. Retrieved from:

[4]     Golay Code. (2021). Wolfram MathWorld the webs most extensive mathematics resource. Retrieved from:

[5]     Gryciuk, Y., & Grytsyuk, P. (2016). Implementation details for the cipher key generation Cardano permutation. Modern Problems of Radio Engineering, Telecommunications and Computer Science. Proceedings of the 13th International Conference on TCSET2016, 498–502.

[6]     Gryciuk, Yu., & Grytsyuk, P. (2015). Perfecting of the matrix Affine cryptosystem information security. Computer Science and Information Technologies: Proceedings of Xth International Scientific and Technical Conference (CSIT2015), 14–17 September, 2015, 67–69.

[7]     Hall, M. Jr. (1986). Combinatorial Theory. John Wiley & Sons, 464 p. [In Russian].

[8]     Kis, Y. P. (1997). Modeling and synthesis of protective codes by ideal ring bundles. The thesis for Ph.D. degree. State University "Lvivska Politechnika". Lviv, 16 p. [In Ukrainian].

[9]     Macleod, M. D. (1993). Coding. In Telecommunications Engineers Reference Book. Cyclic Code. Retrieved from:

[10]  Peterson, W. Wesley, & Weldon, E. J. (1972). Error-correcting codes, The MIT Press; secondedition, 560 p.

[11]  Riznyk, V. V. (1989). Synthesis of optimal combinatorial systems. Lviv: Vyshcha shkola, 168 p. [In Ukrainian].

[12]  Riznyk, V. V. (2019). Combinatorial optimization of multidimensional systems. Models of multidimensional intelligent systems. Lviv: Publishing Lvivskoji Politekhniky, 168 p. [In Ukrainian].

[13]  Riznyk, V. V. (2021). Models of intelligent information management technologies. In the book: Theories, Concepts, Implementation (Eds. Marian Duczmac, Tetyana Nestorenko) Monograph. Opole: The Academy of Management and Administration in Opole, 2021.394, 159–169.

[14]  Rotman, J. (1998). Galois Extensions. Universitext, 79–82.