Paper 2, Section I, H
Let denote the maximum size of a binary code of length with minimum distance . For fixed with , let . Show that
where .
[You may assume the GSV and Hamming bounds and any form of Stirling's theorem provided you state them clearly.]
Typos? Please submit corrections to this page on GitHub.