Finding short and light codewords in BCH codes
A new algorithm is presented for finding codewords that are of low weight ("light") and low degree ("short") in narrow-sense binary BCH codes of length n = 2(m) - 1 and minimum weight d = 2(t) - 1, for use in serial implementations. This improves on some earlier results by Roth and Seroussi, and extends the range of parameters to include eases of interest for long CRC error-detection schemes.
serial implementation binary narrow-sense bch codes cyclic redundancy codes