Narrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$.

Shuxing Li Cunsheng Ding Maosheng Xiong Gennian Ge

Published in: CoRR (2016)

Keyphrases

reed solomon
lower bound
error correction
real time
data sets
genetic algorithm
upper bound
error correcting codes
minimal length
finite alphabet