CYCLIC CONCATENATED CODES WITH CONSTACYCLIC OUTER CODES

The known construction of cyclic concatenated codes is based on the fact that the inner code is a cyclic minimal code, the outer code is cyclic, and the lengths of the inner and outer codes are relatively prime. Here, it is shown that if the outer code is a suitably chosen constacyclic code the overall concatenated code is always cyclic regardless of the length of the outer code. Moreover, it follows that any cyclic code of composite length is a direct sum of cyclic concatenated codes with inner cyclic minimal codes and outer constacyclic codes. This description of cyclic codes of composite length leads us to introduce the concept of a poor-code length (PCL). We show that all but low-rate codes of this length have a poor minimum distance. A PCL is directly related to the existence of irreducible binomials. In the binary case, the first few PCL's are 9, 25, 27, 45, 49, 75, 81, and 99. Finally we construct arbitrarily long binary cyclic codes which are better than binary BCH codes of primitive length.