1.5.2 BCH Algorithm

Binary BCH (Bose, Chaudhuri, Hocquenghem) codes were first discovered by A. Hocquenghem in 1959 and independently by R.C. Bose and D.K. Ray-Chaudhuri in 1960. BCH codes are a family of cyclic codes with an algebraic structure that is useful for simplifying the encoding and decoding procedures. Binary BCH codes with a minimum distance of 3 are better known as Hamming codes. BCH codes are a generalization of Hamming codes for multiple error correction, which have been a very popular choice in memory devices due to their simple and fast encoding and decoding procedures.