The automorphisms and error orbits of Reed – Solomon codes

The purpose of this work with its results presented in the article was to develop and transfer to the class of Reed – Solomon codes (RS-codes) the basic provisions of the theory of syndrome norms (TNS), previously developed for the noise-resistant coding of the class of Bose – Chaudhuri – Hocquenghem codes (BCH-codes), which is actively used in theory and practice. To achieve this goal, a transition has been made in the interpretation of the theory of RS-codes from polynomial to matrix language. This approach allows you to fully use the capabilities of Galois field theory. The main difficulty of RS-codes is that they rely on a non-binary alphabet. The same factor is attractive for practical applications of RS-codes. The matrix language allows you to break the syndromes of errors into components that are elements of the Galois field – the field of definition of RS-codes. The TNS for BCH codes is based on the use of automorphisms of these codes – cyclic and cyclotomic substitutions. Automorphisms of RS-codes are studied in detail. The cyclic substitution belongs to the categories of automorphisms of RS-codes and generates a subgroup Г of order N (code length). The cyclotomic substitution does not belong to the class of automorphisms of RS-codes – the power of the alphabet greater than 2 prevents this. When expanding the concept of automorphism of a code beyond substitutions of coordinates of vectors to automorphisms of RS-codes, homotheties or affine substitutions can be attributed, since they also form a cyclic group A of order N. It is shown that cyclic and affine substitutions commute with each other, which, generally speaking, is not typical for linear operators and substitutions. The group Г of cyclic substitutions, the group A of affine substitutions, and the combined AГ group of order N² generate 3 types of error orbits in RS-codes. The structure of the orbits of errors with respect to the action of groups A, Г and the combined group AГ is studied {231 words}.

1. MacWilliams F.J., Sloan J.J. The Theory of Error-Correcting Codes. Amsterdam: North-holland publishing company; 1977.

2. Lipnitsky V.А., Konopelko V.К. [Norm decoding of noise-resistant codes and algebraic equations]. Minsk: BGU; 2007. (In Russ.)

3. Kudryashov B.D. [Fundamentals of coding theory]. St. Petersburg: BHV-Petersburg; 2016. (In Russ.)

4. Sclyar B. [Digital communications. Fundamentals and Applications]. Ed. 2. Moscow: Wil’ams; 2003. (In Russ.)

5. Blejhut R. [Theory and practice of error control codes]. Moscow: Mir; 1986. (In Russ.)

6. Moon Т.К. Error correction coding, mathematical methods and algorithms. New Jersey U.S.A: John Wiley & Sons; 2005.

7. Lipnitsky V.А., Semyonov S.I. [Advantages of using Galois field theory for processing RS-codes]. Sbornik nauchnyh statey Voennoy academii Respubliki Belarus = Sbornik nauchnyh statey Voennoy academii Respubliki Belarus. 2019:36:84-93. (In Russ.)

8. Lipnitsky V.А. [Higher mathematics. Fundamentals of linear algebra and analytic geometry]. Minsk: VA RB; 2015. (In Russ.)

9. Lidl R., Nidderrajter G. [Finite fields]. Moscow: Mir; 1988. (In Russ.)

10. Lipnitsky V.А. [Modern applied algebra. Mathematical fundamentals of protecting information from interference and unauthorized access]. Minsk: BGUIR; 2006. (In Russ.)