A Simplified Lower Bound on Minimum Distance of Convolutional Polar Codes

摘要

A simplified method for estimation of the minimum distance of convolutional polar codes is proposed. It is based on a novel algorithm for computing the minimum weight of cosets of the codes induced by the convolutional polarizing transformation. The proposed method also enables one to reduce complexity of procedure of construction of convolutional polar subcodes.