We study how the Information Rate behaves for Size of Largest Code as . Proposition where is Mathematical Entropy Proof Asymptotic Hamming’s Bound Asymptotic GSV Bound