On Characterization and Existence Conditions of Codes Meeting the Varshamov–Griesmer Bound

We consider the structure of anticode generator matrices for binary linear codes meeting the Varshamov–Griesmer bound. Necessary and sufficient conditions of existence of these codes are derived for a number of different dimensions and code distances.