Upper Bounds for the Number of Points of a Binary Code with a Specified Code Distance

An upper bound is obtained for the number of points of a binary code of length $n$ and code distance $d$; the new bound improves the Elias bound by a factor that grows exponentially with $n$; a new upper bound is also obtained for the number of points of a binary equilibrium code.