On Some Properties of Random Group Codes of Great Length

It is shown that a randomly chosen linear binary code almost certainly satisfies the Varshamov–Gilbert bound. The probability of a large deviation from this bound tends to zero exponentially with increase of the code length.