Fast decoder for triple-error-correcting primitive binary BCH codes with odd m

A triple-error-correcting primitive binary BCH code with odd m is shown to be the intersection of three Hamming codes each of length n=2 ^m-1. Using this property, a decoding algorithm for the code is developed. Based on the algorithm, a hardware decoder is designed by the use of five ROMs, each 2^m×m bits, and several logic gates. In comparison with conventional decoders, the decoder is simpler in complexity and faster in decoding speed