實(shí)現(xiàn)8比特字節(jié)的RS糾錯(cuò)編碼，可以指定極性校驗(yàn)字節(jié)數(shù)目，能產(chǎn)生的最大校驗(yàn)序列長(zhǎng)度為255字節(jié)（含極性校驗(yàn)字節(jié)）.This is an implementation of a reed-Solomon code with 8 bit bytes, and a configurable number of parity bytes. The maximum sequence length (codeword) that can be generated is 255 bytes, including parity bytes.
This thesis is devoted to several efficient VLSI architecture design issues in errorcorrecting
coding, including finite field arithmetic, (Generalized) Low-Density Parity-
Check (LDPC) codes, and reed-Solomon codes.
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
