On covering radius lower bound for a class of binary codes (Q1897944)

The main result is a theorem on doubly exponential limit distribution of the Hamming distance from a random vector to the nearest codeword in a given binary code. From the obtained results lower bounds on the covering radius of certain binary linear codes can be given. The proof of the main result is not given in the paper but in order to give a proof the author claims that he can use a technique suggested in one of the references.