著者

SUN Zhenqiang KIMURA Shigetomo EBIHARA Yoshihiko

出版者

電子情報通信学会

雑誌

IEICE transactions on communications (ISSN:09168516)

巻号頁・発行日

vol.E82.B, no.9, pp.1432-1438, 1999-09

---

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.