**Proof. **Consider summing a weaker inequality obtained from
Theorem 2.7
by eliminating the floor function. Summing over iterations
1...*m* of the G-construction we get:

d--2 |
|||

m(d - 2) - |

Noting that for trivially seeded codes, and 0, we may reduce this to:

Furthermore, since we are dealing with minimal *G*-codes,

width4pt depth2pt height6pt

In the case of a *G*-family seeded by a non-trivial code of length
*n*_{0} and covering radius , Corollary 2.11 may
be easily generalized to:

Specifically, Corollary 2.11 asymptotically binds

http://people.bu.edu/trachten