BCH code
ERROR-CORRECTING CODES
Bose-Chadhuri-Hocquenghem Codes; BCH Code; Bose-Chadhuri-Hocquenghem Code; Bose-Chaudhuri-Hocquenghem; BCH codes; Peterson–Gorenstein–Zierler algorithm; Bose-Chaudhuri- Hochquenghem; Bch error correcting codes; Peterson-Gorenstein-Zierler algorithm; Bose–Chaudhuri–Hocquenghem code; Bose-Chaudhuri-Hocquenghem code
In coding theory, the Bose–Chaudhuri–Hocquenghem codes (BCH codes) form a class of cyclic error-correcting codes that are constructed using polynomials over a finite field (also called Galois field). BCH codes were invented in 1959 by French mathematician Alexis Hocquenghem, and independently in 1960 by Raj Chandra Bose and D.