A.Е. Zhulyov, A.P. Ratushin, Е.V. Rachinsky

Continuous rarefied codes (CRC) are one of the modern methods of correcting encoding. As a result of examining the principle of CRC structure it\'s been found that the code can be directly presented through parity check equations which are convolutions of coded sequence symbols and code syndrome former coefficients. The parity check equations are represented as symbol transition graph that is useful for a number of practical applications. The graph consists of vertices corresponding to coded sequence symbols, and edges connecting them according to the parity check equations. It was demonstrated that parity check equations may be used for detecting CRC, that leads to formation of options examining algorithms with small sample size required and high noise immunity.

 

1. Berrou S., Glavieux A.,Thitimasjshima P. Near Shannon limit error-correcting coding and decoding: Turbo codes (1) // Proc. IEEE Int. Conf. on Communications. Geneva, Switzerland. May 1993. P. 1064-1070.
2. Feltstrom A.J., Zigangirov K.Sh. Periodic time-varying convolutional codes with low-density parity-check matrices // IEEE Trans. Inform. Theory. V. 45. № 5. Sept. 1999. P. 2181-2190.
3. Ratushin A.P., Rachinskijj E.V. Sposob predstavlenija svertochnogo koda v vide dvudolnogo grafa // Sb. dokladov XV Vseross. NPK «Problemy razvitija i primenenija sredstv PVO na sovremennom ehtape. Sredstva PVO Rossii i drugikh stran mira, sravnitelnyjj analiz» (2-3 oktjabrja 2014 g.). Sekcii 1-5.  JAroslavl: filial VKA im. A.F. Mozhajjskogo. 2014. S. 418-423.
4. Tanner. R.M. A Recursive Approach to Low Complexity Codes // IEEE Trans. Inf. Theory. V. IT-27. № 5. Sept. 1981. R. 533-547.