ENCODING CIRCUIT FOR REED-SOLOMON CODE

PROBLEM TO BE SOLVED: To improve the efficiency of an encoding circuit for Reed-Solomon code which adds redundant data to information to be transmitted by reducing the amount of operation of a shift register by computing information one symbol by one symbol. SOLUTION: While k-symbol information to be transmitted is inputted, the inputted information is outputted as it is and, at the same time, inputted to a shift register by closing a switch 7 and the shift register computes the information which is divided at every (a) bits after the information is converted front the unit o bits into the unit of symbols on a table 3 as an atom. A multiplier 1 multiplies each term of a polynominal G(x) for generating Reed-Solomon code by input data, one symbol by one symbol and an adder 2 adds bits, one bit by one bit. Therefore, a Reed-Solomon code can be encoded at a high speed by making the best use of the characteristic of the code and, at the same time, improving the efficiency of operation by remarkably reducing the amount of operation and reducing the number of shifting times to k times front (k×a) times.