Algorithms of coding and decoding for code with code signal feature

Providing a high level of informational reliability and, firstly, noise immunity is the main problem of information channel (IC) synthesis. Quantitatively noise immunity is measured by reception outcome probabilities: probability of correct reception, false reception and protective failure. The most urgent problem of the IC noise immunity improvement is minimization of the false reception probability. When IC is under the influence of high intense noise, this problem is usually solved by cascade coding usage with application of code with code signal feature (CSF) at the final stage of encoding. The structure of the code with CSF and its features were described in details in previous works of the authors. This paper contains mathematical models of coding and decoding procedures for code with CSF. Also it is shown that despite the code with CSF is a combinatorial non-linear, inseparable code with a constant weight by the structure, its coding and decoding algorithms can be mathematically described using linear algebraic code theory. It gives a significant advantage for the synthesis of the IC with improved noise immunity, so they can operate under influence of high intensity noise.