Construction of high rate punctured convolutional codes through identical codes

There exists an identical high rate ordinary convolutional code with a punctured convolutional code. We show a method for obtaining good rate R = (n - 1)/n punctured convolutional codes through the identical codes with the best punctured convolutional codes of rate (n - 1)/n obtained by exhaustive searches for rate 1/2 original codes and puncturing matrices, and the method can find out punctured convolutional codes superior to the best code obtained by exhaustive searches for rate 1/3 original codes and puncturing matrices. For generating matrices of identical codes, we construct new identical codes with punctured convolutional codes by combining row vectors of each individual matrix. We present good punctured convolutional codes with rate R = (n - 1)/n,n = 6, ···, 13 by computer searches through those identical codes.