Efficient CRC concatenation scheme for polar codes

A new cyclic redundancy check (CRC) concatenation with polar codes based on partial protection is proposed, where only the crucial bits chosen from the total information bits are protected with the CRC. The index set of crucial bits is determined by the row weight of generator matrix of polar codes and the indexes with minimum row weight make up this crucial set. Using this new concatenation, the number of polar codewords with minimum Hamming weight can be efficiently decreased. Simulation results show that the performance of the proposed partial protection scheme owns a lower error floor than that of the classical blind protection.