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