This paper presents the generator polynomial matrices and the upper bound o
n the constraint length of punctured convolutional codes (PCCs), respective
ly. By virtue of these properties, we provide the puncturing realizations o
f the good known nonsystematic and systematic high rate CCs.