Decoder complexity for BCH codes
B.G. Bajoga, W.J. Walbesser · Proceedings of the Institution of Electrical Engineers · 1973
The logic complexity and computational complexity of decoders for BCH codes are investigated, and bounds on complexity are obtained. These are compared with earlier. results of Savage for arbitrary block codes and for some special decoding rules. It is found that decoders for the class of BCH codes are of much lower complexity.