On a Classification of Cyclic Subcode Chains

摘要

The distance profiles of linear block codes can be employed to design the transport format combination indicators in CDMA systems. In this paper, in order to compare the distance profiles of any given cyclic code over GF(q) with length n = q~m-1, we consider a classification on its cyclic subcode chains. Some counting problems about the classification are also investigated.