On the Maximum Size of Block Codes Subject to a Distance Criterion
On the Maximum Size of Block Codes Subject to a Distance Criterion
We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than d. The achievability argument involves an iterative construction of a set of radius-d balls, each centered at a codeword. We demonstrate that the number of such balls that cover …