Construction of a Class of Linear Binary Codes Achieving the Varshamov?Griesmer Bound

A class of optimal (in the sense of achieving the Varshamov–Griesmer bound) linear binary codes is described; it is strictly included in the class of Solomon–Stiffler codes. A subclass of the given class of codes is constructively defined for the case of relatively small code distances.