Automaton Presentations of Reed-Solomon Codes
Володимир Андрійович Лужецький, Vasyl Semerenko · 2019
The automaton models of Reed-Solomon codes using finite automaton in Galois fields (linear finite-state machines-LFSM) are proposed. The classification of LFSM from the point of view of error correcting coding was carried out and eight types LFSM are suggested. A using of this mathematical model for error correcting codes of fourth generation in optical communication is grounded.