Properties and applications of G­-orbits polynomial invariants of errors in reverse codes

Abstract

In this paper is described a two­step procedure for polynomial­norm error correction with reverse error correcting codes. Such codes of length n traditionally are defined by check matrix HR = (βi,β−i)T, 0 ≤ i ≤ n – 1, β = α(2m−1)/n and α is primitive element of GF(2m). Also in paper you can find a description of error correction algorithm and an example based on reverse code of length 89.

Keywords

• error correcting codes
• code minimal distance
• reverse codes
• bch codes
• norm method of error correction