Cyclic and pseudo-cyclic byte error-correcting codes

The correction properties of a cyclic code depend on the generator polynomial, g(X). The authors have constructed and implemented in C++ an algorithm to identify such properties by analyzing all the remainders modulo g(X). In this paper we apply the algorithm to determine a binary generator polynomial for error correcting codes over GF(2/sup s/).