bch and reed-solomon decoder simulation

simulation of binary and non-binary bch decoder

simulation of binary bch decoding algorithm for bch(n, k) with t bits error correction capability.
three steps:
syndrome generation + inverse-free Berlekamp-Massey algorithm + chien search algorithm
simplifie = 1 sets the simplified version of Berlekamp-Massey algorithm, which takes t cycles while normal BMA takes 2t cycles.

simulation for non-binary bch (reed-solomon) decoding algorithm RS(n, k):
3 steps: syndrome+BMA+chien

for both simulation, n, k and t can be changed according to the size and correction ability of the code