Abstract:

A novel approach of blind identifying of binary linear block code based on association rules is proposed. This method makes full use of the correspond relationship between each information bits to its parity check bits of the binary block code. If the inner correspond relationship of a binary sequence can be found by association rules, the linear block code of the sequence is correctly recognized. Firstly, the binary sequence is arranged to a matrix, then the matrix is divided into two parts. Therefore, each row of the matrix are becoming two items and two itemsets of the matrix are obtained. After that, the support and confidence of each itemset are calculated. According to the characteristics of the relationship of each information bits to its parity check bits of the binary block code, the linear block code is identified by traversing the way of finding the maximum confidence and the minimum mapping types. As only two parts of the matrix is concerned, the computing complexity of the association rule is degrade greatly. Compared with other mehods, the association method is suitable for low error rate of the sequence. Simulation results show that the proposed method has some strong points as high robustness,effectiveness and high accurate recognition, which indicate that the method has a certain value in future engineering application.