The Reed-Somolon CODE is specified by the finite field, the length
(length <= 2^m-1), the number of redundant symbols (length-k), and
the initial zero of the CODE, init_zero, such that the zeros are:
init_zero, init_zero+1, ..., init_zero+length-k-1
Encoding and decoding of the binary extended (24,12,8) Golay CODE:
An arithmetic decoding algorithm. It is a very close relative of the error-trapping decoding algorithms developed by Kasami in the 1960s.
