Preview

Herald of Dagestan State Technical University. Technical Sciences

Advanced search

INTERLEAVING BURST ERROR ELEMENTS IN INFORMATION ARRAYS USING THE METHOD OF INDEX STRUCTURISATION

https://doi.org/10.21822/2073-6185-2019-46-4-84-90

Abstract

Objectives. “Burst errors” representing groups of accidentally or intentionally distorted or “erased” characters in blocks of information arrays violate the integrity of their content. However, the use of special codes for detecting and correcting such errors significantly reduces the speed of information transfer due to the need to introduce redundancy in the form of a large number of control characters. Therefore, this study sets out to develop a method for correcting burst errors.

Method. A possible approach for correcting burst errors consists in interleaving preliminary permutations of information array elements between different array blocks. After eliminating the results of element permutations, these procedures cause the interleaving of distorted elements occurring during the transfer or storage of the information array between its various blocks, causing single or minor fold errors.

Result. For solving problems of this class, a new method of permuting elements of an nxnset of finite sets is proposed based on the index structuring of the formed configurations. These sets are interpreted as information arrays of the same configuration, and the permutation – interleaving – of their elements is carried out according to the method of configuration formed by the index structuring of their location.

Conclusion. Three methods for interleaving elements of the original information in arrays are proposed: between rows, between columns and combined – between rows and columns. The proposed interleaving methods based on the preliminary conversion of information arrays by permuting elements according to given algorithms allow their distortions under the influence of burst errors to be corrected. Thus, the task of combating the burst errors leading to the destruction of individual groups of characters can be reduced to solving a simpler problem of minor fold error correction. 

About the Authors

I. P. Kadiev
Daghestan State Technical University
Russian Federation

Applicant, Department of Management and Informatics in Technical Systems and Computer Engineering,

70 I. Shamil Ave., Makhachkala 367026



P. A. Kadiev
Daghestan State Technical University
Russian Federation

Cand. Sci. (Technical), Assoc. Prof., Department of Management and Informatics in Technical Systems and Computer Engineering,

70 I. Shamil Ave., Makhachkala 367026



B. R. Kudaev
Daghestan State Technical University
Russian Federation

Graduate Student, Department of Management and Informatics in Technical Systems and Computer Engineering,

70 I. Shamil Ave., Makhachkala 367026



References

1. Klark Dzh., Keyn Dzh. ml., Kodirovaniye s ispravleniyem oshibok v sistemakh tsifrovoy svyazi.- M.: «Radio i svyaz'», 1987g. -390s [Clark, J., Kane, J. Jr., Error-correcting coding in digital communication systems .- M.: “Radio and Communication”, 1987. 390 p. (In Russ)]

2. Mutter V.M. Osnovy pomekhoustoychivoy teleperedachi informatsii.-L.: Enegoatomizdat,1990.- 435s. 3 [Mutter V.M. Fundamentals of noise-resistant television information transmission.-L .: Enogoatomizdat, 1990. 435p. (In Russ)]

3. Shennon K. Raboty po teorii informatsii i kibernetike. - M.: Izd.IL. 1963.- 843s [Shannon K. Works on information theory and cybernetics. M .: Izd. IL. 1963. 843p. (In Russ)]

4. Vilenkin N.YA. Kombinatorika. - M.: «Nauka»,1969g.,328s [Vilenkin N.Ya. Combinatorics. - M.: “Science”, 1969, 328p. (In Russ)]

5. Tarakanov V.Ye., Aygner M.A. Kombinatornaya teoriya. M.: Mir,1982, 362s. [Tarakanov V.E., Aigner M.A. Combinatorial Theory. M.: Mir, 1982, 362p. (In Russ)]

6. Kholl M. Kombinatorika. /Perevod s angliyskogo S.A. Shirokova pod red. A.O. Gel'fanda i Tarakanova V.Ye.- M.: Mir,1970. s.10-50 [Hall M. Combinatorics. / Translation from English S.A. Shirokova, ed. A.O. Gelfand and Tarakanova V.E. M .: Mir, 1970, pp.10-50. (In Russ)]

7. Stenli R. Perechislitel'naya kombinatorika - M.: Mir, 1990g. [ Stanley R. Enumeration combinatorics - M .: Mir, 1990. (In Russ)]

8. Rybnikov K.A. Vvedeniye v kombinatornyy analiz.- M.: izd. MGU, 1994g. [Rybnikov K.A. Introduction to combinatorial analysis.- M .: ed. Moscow State University, 1994. (In Russ)]

9. http://www.google/ru. Algoritmy indeksnoy sortirovki massivov dannykh 1 [http: // www. google / ru. Algorithms for indexing data arrays (In Russ)]

10. Leont'yev V.K. Izbrannyye zadachi kombinatornogo analiza.- M.: izd-vo MGTU im. N.E. Baumana, 2001. s. 20- 30. [Leontyev V.K. Selected tasks of combinatorial analysis. - M.: Publishing House of MSTU. N.E. Bauman, 2001. pp. 20-30. (In Russ)]

11. Volkova V.N. Teoriya sistem i sistemnyy analiz. Uchebnik / V. N. Volkova, A. A. Denisov Teoriya sistem i sistemnyy analiz. – M.: Yurayt, 2015.-615s. [Volkova V.N. Theory of systems and systems analysis. Textbook / V.N. Volkova, A.A. Denisov Theory of systems and system analysis. M .: Yurayt, 2015. 615p. (In Russ)]

12. Dénes J. H., Keedwell A. D. Latin squares: New developments in the theory and applications. Annals of Discrete Mathematics vol. 46. Academic Press. Amsterdam. 1991.

13. Rybnikov K. A. Kombinatornyy analiz. Ocherki istorii. — M.: Izd. mekhmata MGU, 1996. — 124 s.[Rybnikov K. A. Combinatorial analysis. Essays on the story. - M.: Publishing. Mehmat Moscow State University, 1996 . 124 p. (In Russ)]

14. Andersen Dzh.A. Diskretnaya matematika i kombinatorika: /per. s angl.- M.: Vil'yams, 2003. [Andersen J.A. Discrete mathematics and combinatorics: / Per. from English.- M.: Williams, 2003. (In Russ)]

15. Kadiyev I.P. Ob odnom klasse kombinatornykh konfiguratsiy. / Kadiyev I.P. , Kadiyev P.A. Vestnik Dag. Gos. Tekh.. Un-ta, T.31. 2013.- s.45-50 [Kadiev I.P. On a class of combinatorial configurations. / Kadiev I.P. , Kadiev P.A. Herald of the Dagestan State Technical University. Technical science. T.31. 2013.p. 45-50. (In Russ)]

16. Kadiyev I.P., Melekhin V.B. Sistema indeksnoy strukturizatsii kombinatornykh konfiguratsiy me-todom rekurrentnykh sootnosheniy dlya zashchity peredavayemykh po kanalam svyazi dannykh. zh. Pribory i sistemy. Upravleniye, kontrol', diagnostika. № 2, 2019g.- s.37-43[Kadiev I.P., Melekhin V.B. An index structuring system for combinatorial configurations using the method of recurrence relations to protect data transmitted through communication channels. g. Devices and systems. Management, control, diagnostics. No. 2, 2019 рр. 37-43.


Review

For citations:


Kadiev I.P., Kadiev P.A., Kudaev B.R. INTERLEAVING BURST ERROR ELEMENTS IN INFORMATION ARRAYS USING THE METHOD OF INDEX STRUCTURISATION. Herald of Dagestan State Technical University. Technical Sciences. 2019;46(4):84-90. (In Russ.) https://doi.org/10.21822/2073-6185-2019-46-4-84-90

Views: 526


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2073-6185 (Print)
ISSN 2542-095X (Online)