An efficient puncturing method for the short and long length polar codes

An efficient puncturing technique for polar codes is presented in this paper. Codes are constructed based on a property, in which the generator matrix of the code can be represented based on the generator matrix of shorter codes. Considering this structure, it is concluded that punctured bits considered for a code can also be used as the punctured bits of the longer code. This leads to implement a puncturing algorithm that can be used for the short or long length codes. Conducted simulations confirm that the new puncturing technique outperforms the previously proposed ones. This is evident for different code rates.