Encoding and Decoding for Cyclic Permutation Codes

Maximum-likelihood encoding and decoding procedures are presented for cyclic permutation error-correcting codes. These procedures take advantage of the cyclic permutation structure, and are applicable to all such codes. On the other hand, familiar parity-checking procedures are applicable only to those few cyclic permutation codes which are group codes. A comparison of the two different procedures for the group code case shows that they are roughly comparable in complexity.