中文摘要：

针对信道编码的盲识别问题，提出了高误码率下（2，1，m）卷积码的盲识别方法．首先给出了盲识别的数学模型，进而通过容错矩阵分解来求解线性含错方程，证明了通过对截获码序列进行容错矩阵分解可以解决卷积码的盲识别问题．这是一个全新的研究课题，在智能通信、信息截获、密码分析等领域有重要的应用．仿真实验表明，该算法可以对高误码率的卷积码进行有效的识别．

英文摘要：

In order to solve the problem of the blind recognition of channel coding, a method of blind recognition of （2,1 ,m） convolution coding in the high error rate condition is proposed. Firstly, the mathematical model of the blind recognition is given, and then the linear error equation is solved though the decomposition of fault- tolerant matrix. The authors show that decomposing the fault-tolerant matrix of the intercepted codes can be used to solve the problem of blind recognition of convolution coding, which is a novel important research topic in adaptive communication, information interception and cryptanalysis. The simulation experiments show the proposed method can recognize the convolution coding parameters in the high error rate condition effectively.