On Error Correction by Generalized Convolutional Concatenated Codes

The article introduces linear binary nonsystematic generalized convolutional concatenated codes, based on Reed–Solomon codes and constant nonsystematic binary convolutional codes. Asymptotic lower bounds are obtained for the free code distance of such codes, and the way in which these bounds depend on the structure and order of the concatenated code is investigated. The complexity of the solution of the problem of constructing generalized convolutional concatenated codes with asymptotically good correcting properties is analyzed.