Combinatorial constructions of cyclic convolutional self-orthogonal codes

Convolutional self-orthogonal(CSO) codes were first introduced by Massey (1963). Their decoders employ majority-logic decisions and present a fixed delay, while the complexity grows exponentially with the code rate when maximum likelihood (Viterbi) decoding is used. Hence, for extremely high rate and high speed coding applications, convolutional self-orthogonal codes are of practical significance. In this paper, block designs with cyclic structure are used to derive new families of cyclic CSO codes. The exact effective constraint lengths of these codes are obtained. An example and comparisons are also given