Abstract
The sphere bound is a trivial lower bound on K(n,R), the minimal cardinality of any binary code of length n and with covering radius R. By simple arguments it is considerably improved, to K(n,1)⩾2 n/n for n even. A table of lower and upper bounds on K(n,R) for n⩽33, R ⩽10 is included
Original language | English |
---|---|
Pages (from-to) | 237-245 |
Number of pages | 9 |
Journal | IEEE Transactions on Information Theory |
Volume | 34 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1988 |