FACTORIAL CODING WITH ERROR CORRECTION
DOI:
https://doi.org/10.15588/1607-3274-2017-3-15Keywords:
Redundancy, factorial code, permutation, error control coding, error correction, error detection, reliability of data transmission, relative transmission rate.Abstract
Context. Factorial data coding allows combining operations of cryptographic protection, intentional alteration of data, and errorcorrecting coding which leads to the decrease of redundancy introduced by transmitter and to the increase of data rate and effective throughput. At the same time, the described methods of factorial coding do not correct errors, which limits their use.
Objective of this work is to develop a method of factorial coding with data recovery that provides a comprehensive solution of cryptographic protection and error control coding and allows combining the functions of communication channel errors detecting and correcting.
Method. The basic idea of the proposed coding method is to increase the distance between the allowed code words that represent permutations calculated for all information bits of a data block and represented in a binary form. The methods of distance increasing based on Euclidean and Hamming metrics are investigated. The basic properties of factorial code with error correction are defined for each of these methods. The estimate of probability characteristics is done on the condition of independence of communication channel errors and their binomial distribution. The receiver structures are developed. Decoding rules implemented in receiver are based on the maximum likelihood criteria and provide both forward error correction and error detection with further correction by retransmission of damaged data block.
Results. The factorial error-correcting codes using Euclidean and Hamming metrics are implemented. The comparative analysis of the probability of an undetected error, the residual probability of erroneous reception, energy gain, and the relative transmission rate is done for these codes. It is shown that code characteristics are not invariant to the set of allowed code words, and the codes that use Hamming metric are the most efficient codes between the presented codes.
Conclusions. The method of factorial coding data recovery by permutation has been further developed. Due to the combination of error correction and detection functions, it can increase the rate loss dynamic component and, consequently, the relative transmission rate, compared to error-detecting factorial coding by reducing its noise immunity. The experiments confirmed the effectiveness of the factorial error-correcting codes.References
Faure E’. V., Shvydkij V. V., Shherba A. I. Kontrol’ celostnosti informacii na osnove faktorial’noj sistemy schisleniya, Journal of Qafqaz University. Mathematics and computer science, 2016, No. 2, Vol. 4. (V pechati).
Faure E’. V., Shvydkij V. V., Shherba V. A. Metod formirovaniya imitovstavki na osnove perestanovok, Zaxist іnformacії, 2014, No. 4, Vol. 16, pp. 334–340. DOI: 10.18372/2410- 7840.16.7620.
Faure E’.V., Shvydkij V. V., Shherba V. A. Kombinirovannoe faktorial’noe kodirovanie i ego svojstva, Radio Electronics, Computer Science, Control, 2016, No. 3, pp. 80–86. DOI: 10.15588/1607-3274-2016-3-10.
Faure E’.V. Faktorial’noe kodirovanie s vosstanovleniem dannyx, Visnyk Cherkas’kogo derzhavnogo tehnologichnogo universytetu, 2016, No. 2, pp. 33–39.
Faure E’.V. Metod povysheniya e’ffektivnosti faktorial’nogo kodirovaniya s vosstanovleniem dannyx, Visnyk Cherkas’kogo derzhavnogo tehnologichnogo universytetu, 2016, No. 4. (V pechati).
Faure E’.V. Faktorial’noe kodirovanie s neskol’kimi kontrol’nymi summami, Visnyk Zhytomyrs’kogo derzhavnogo tehnologichnogo universytetu, 2016, No. 3, pp. 104–113.
Piterson U., Ue’ldon E’.; [per. s angl. pod red. R. L. Dobrushina, S. I. Samojlenko] Kody, ispravlyayushhie oshibki. Moscow, Mir, 1976, 590 p. (Redakciya literatury po novoj texnike).
Fink L. M. Teoriya peredachi diskretnyx soobshhenij. [Izd. 2-e, pererab. i dopoln.]. Moscow, Sovetskoe radio, 1970, 728 p.
Teplov N. L. Pomexoustojchivost’ sistem peredachi diskretnoj informacii. Moscow, Svyaz’, 1964, 360 p.
Konvej Dzh., Sloe’n N. ; pri uchastii E’. Bannai i dr.; [perevod s angl. S. N. Licyna i dr.] Upakovki sharov, reshetki i gruppy : v 2 t. Moscow, Mir, 1990, 2 t.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2017 E. V. Faure
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
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.
-
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.
