Some lower bounds on the number of code points in a minimum distance binary code. I

M(n, d) denotes a maximal set of n-place binary sequences with entries 0 and 1 such that the Hamming distance between any two sequences of the set is at least d.| M(n, d) | denotes the number of sequences in the set M(n, d). In this paper we obtain some lower bounds for | M(n, d) | for special values of n and d. The results are better than the known results due to Gilbert