Recognition signs of continuous correcting codes in the discrete sequences

The growing quantity of new correcting code constructions does actual a problem of development of their recognition and identification universal methods with a view of signals radio monitoring. In article probings results on revealing of continuous correcting convolutional codes and convolutional turbocodes recognition signs in the discrete sequences under conditions of a code presence aprioristic ambiguity are presented. For the problem decision it is offered to use the algebraic method based on the linear equations system by a Gauss method, made of analyzed discrete sequence. With a view of correct shaping of necessary equations system in article the analytical model convolutional turbocode is presented. The received informative signs are based on distinctions by a Gauss method converted matrixes that allows to distinguish presence in the discrete sequence of this or that code. Besides, there is a determination possibility of the considered codes major parametres.