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

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 $H_{R}=(\beta^{i},\beta^{-i})^{T}, 0\leq i\leq n-1, \beta=\alpha^{\frac{2^{m}-1}{n}}$ and $\alpha$ is primitive element of $GF(2^{m})$. Also in paper you can find a description of error correction algorithm and an example based on reverse code of length $89$.