A Note on Upper Bounds for Minimum Distance Codes

Some upper bounds are given on the number of sequences of n binary symbols which can be found such that every pair of sequences differs in at least d positions.