Cyclic and pseudo-cyclic byte error-correcting codes
Ioan Cleju, Adriana Sîrbu
Abstract
Ioan Cleju, Adriana Sîrbu
Abstract
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/).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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/).
Key concepts: Cyclic code, Modulo, Polynomial code, Error detection and correction, Binary number, Byte, Generator (circuit theory), Polynomial