An asymptotic bound on the covering radii of binary BCH codes.

Aimo Tietäväinen

Published in: IEEE Trans. Inf. Theory (1990)

Keyphrases

worst case
reed solomon
logical operations
upper bound
error correcting
asymptotically optimal
error correction
error correcting codes
lower bound
binary codes
closed form expressions
worst case analysis
error bounds
np hard
hamming distance
marginal likelihood
expected values
gray code
minimum volume