Construction of high-rate punctured convolutional codes through dual codes

Punctured convolutional codes are error-correcting codes that can be used to achieve reliable data transfer in digital communication systems. This paper considers a method to search good high-rate punctured convolutional code encoders using dual codes, which are often utilized to evaluate block codes. A low-rate R = 1=n convolutional code has a dual code identical to a punctured convolutional code with rate R = (n - 1)/n. This implies that a low-rate R = 1/n convolutional code can help the search of punctured convolutional code encoders. In simple terms, this means that the strategy involves searching all of many candidate dual code encoders. This paper shows it is not difficult to list all the useful dual code encoders from a given convolutional code with rate R = 1/n, and we give some examples of the best punctured convolutional code encoder with rate R = (n - 1)/n obtained through dual code.