Upper bounds on the cardinality of a binary code with a given minimum distance

This paper obtains an upper bound on the cardinality of a binary code of length n and minimum distance d, which improves on the Elias bound exponentially in n. A new upper bound for the cardinality of a constant-weight binary code is also presented