A Note on Greedy Codes

In their paper (J. Combin. Theory Ser. A64(1993), 10–30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that these codes also satisfy the Varshamov–Gilbert bound.