The systematic selection of cyclically equivalent codes (Corresp.)

A systematic procedure for constructing one member of each cyclic equivalence class of an (n, k + 1) Reed-Solomon code is presented. It is shown that if the procedure is modified to exclude those codewords that do not have maximum period, the resulting set of codewords constitutes a synchronizable code having comma freedom of degree n - 2k .