Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Just a quick question. What Galois Field is best if you need a minimum Hamming distance of $n$? I want to design a BCH generator polynomial that is acccording to this Hamming distance.
This reference provides specific implementations for three error correcting BCH generators with a minimum hamming distance of 7
Note, also refer to Peterson's Table of Irreducible Polynomials which lists all primitive and irreducible polynomials over GF(2):
Required, but never shown