A Note on the Computation of the Hamming Bound

Abstract

This paper derives a simple approximation to a binomial sum occurring in the Humming Bound. The approximation is easy to compute and quite accurate, even for modest values of the parameters involved. The approximation permits easy calculation of the minimum number of parity bits required for t error correction.