A Lower Bound on Minimum Distance of Convolutional Polar Codes

A lower bound on minimum distance of convolutional polar codes is provided. The bound is obtained from the minimum weight of generalized cosets of the codes generated by bottom rows of the polarizing matrix. Minimum weight of cosets is also used for construction of convolutional polar subcodes, which provide lower FER under list SC decoding compared to polar subcodes and convolutional polar codes.