2003Unpublished venueRequires access

Cyclic and pseudo-cyclic byte error-correcting codes

Ioan Cleju, Adriana Sîrbu

Open publisher page 0 citations

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/).

About this research paper

What this paper is about

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/).

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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/).

Key concepts: Cyclic code, Modulo, Polynomial code, Error detection and correction, Binary number, Byte, Generator (circuit theory), Polynomial

Related papers

Back to paper searchBrowse research topicsOriginal source
Cyclic and pseudo-cyclic byte error-correcting codes — Research Paper | ScholarLens