Source: http://journals.uran.ua/eejet/article/view/157299
Timestamp: 2019-04-25 04:05:06+00:00

Document:
The influence of the theory of information on development of the error correcting coding theory has been studied. Main differences between the probabilistic approach and the deterministic approach in the analysis of error-correcting capabilities of different classes of linear codes have been demonstrated.
The automaton hierarchical models for analysis of permutation decoding of cyclic codes have been developed and a cyclic permutation generator based on two Moore automata has been proposed.
A study has been carried out into the regular and irregular states of linear finite-state machines (LFSM) based on the automaton representation of cyclic codes. A possibility of significant simplification of decoding of cyclic codes based on conversion of irregular LFSM syndromes into regular ones using permutations has been shown.
The formalized methods for determination of error-correcting capabilities of iteratively decoded cyclic codes (IDCC) have been devised. They imply the replacementof traditional complete checking of all possible options for comparison of code words to directional search for the solution of the assigned problem, which leads to a significant time saving for calculations. The algorithm for determination of error-correcting capabilities of IDCC with respect to double errors is given.
It has been shown that all iterative codes increase their error-correcting capabilities with an increase in the number of iterations and one can set it as a percentage for errors of various multiplicities. A distribution of error syndromes to separate iterations has been performed, which makes it possible to reduce the length of a check word in a code. As a result, this leads to an increase in a rate of iterative codes in comparison with the traditional correction codes.
Shennon, K. (1963). Raboty po teorii informacii i kibernetike. Moscow, 829.
Ursul, A. D. (1968). Priroda informacii. Filosofskiy ocherk. Moscow: Politizdat, 288.
Kolmogorov, A. N. (1965). Tri podhoda k opredeleniyu ponyatiya “kolichestvo informacii”. Problemy peredachi informacii, 1 (1), 3–11.
Kolmogorov, A. N. (1987). Teoriya informacii i teoriya algoritmov. Moscow: Nauka, 304.
Bulychev, I. I., Soroka, M. Yu. (2016). About the nature and the essense of information. Noosfernye issledovaniya, 1-2 (13-14), 191–207.
Piterson, U., Ueldon, E. (1976). Kody, ispravlyayushchie oshibki. Moscow: Mir, 596.
Sklyar, B. (2004). Cifrovaya svyaz'. Teoreticheskie osnovy i prakticheskoe primenenie. Moscow: Izd. dom «Vil'yams», 1104.
Klark, Dzh. ml., Keyn, Dzh. (1987). Kodirovanie s ispravleniem oshibok v sistemah cifrovoy svyazi. Moscow: Radio i svyaz', 392.
Uryvskiy, L. A., Osipchuk, S. A.; Bezruk, V. M., Barannik, V. V. (Eds.) (2017). Issledovanie svoystv pomekhoustoychivyh kodov klassa LDPC. Naukoemkie tekhnologii v infokommunikaciyah: obrabotka informacii, kiberbezopasnost', informacionnaya bor'ba. Kharkiv, 137–139.
Berlekemp, E. (1971). Algebraicheskaya teoriya kodirovaniya. Moscow: Mir, 477.
Semerenko, V. P. (1998). Parallel Decoding of Bose-Chaudhuri-Hocquenghem Codes. Engineering Simulation, 16 (1), 87–100.
Semerenko, V. P. (2015). Teoriya tsyklichnykh kodiv na osnovi avtomatnykh modelei. Vinnytsia: VNTU, 444.
Gallager, R. (1966). Kody s maloy plotnost'yu proverok na chetnost'. Moscow: Mir, 144.
Shennon K. Raboty po teorii informacii i kibernetike. Moscow, 1963. 829 p.
Ursul A. D. Priroda informacii. Filosofskiy ocherk. Moscow: Politizdat, 1968. 288 p.
Kolmogorov A. N. Tri podhoda k opredeleniyu ponyatiya “kolichestvo informacii” // Problemy peredachi informacii. 1965. Vol. 1, Issue 1. P. 3–11.
Kolmogorov A. N. Teoriya informacii i teoriya algoritmov. Moscow: Nauka, 1987. 304 p.
Bulychev I. I., Soroka M. Yu. About the nature and the essense of information // Noosfernye issledovaniya. 2016. Issue 1-2 (13-14). P. 191–207.
Piterson U., Ueldon E. Kody, ispravlyayushchie oshibki. Moscow: Mir. 1976, 596 p.
Sklyar B. Cifrovaya svyaz'. Teoreticheskie osnovy i prakticheskoe primenenie. Moscow: Izd. dom «Vil'yams», 2004. 1104 p.
Klark Dzh. ml., Keyn Dzh. Kodirovanie s ispravleniem oshibok v sistemah cifrovoy svyazi. Moscow: Radio i svyaz', 1987. 392 p.
Uryvskiy L. A., Osipchuk S. A. Issledovanie svoystv pomekhoustoychivyh kodov klassa LDPC. Naukoemkie tekhnologii v infokommunikaciyah: obrabotka informacii, kiberbezopasnost', informacionnaya bor'ba: kolekt. monogr. / V. M. Bezruk, V. V. Barannik (Eds.). Kharkiv, 2017. P. 137–139.
Berlekemp E. Algebraicheskaya teoriya kodirovaniya. Moscow: Mir, 1971. 477 p.
Semerenko V. P. Parallel Decoding of Bose-Chaudhuri-Hocquenghem Codes // Engineering Simulation. 1998. Vol. 16, Issue 1. P. 87–100.
Semerenko V. P. Teoriya tsyklichnykh kodiv na osnovi avtomatnykh modelei: monohrafiya. Vinnytsia: VNTU, 2015. 444 p.
Gallager R. Kody s maloy plotnost'yu proverok na chetnost'. Moscow: Mir, 1966. 144 p.

References: V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V.