On the covering radius of binary (14, 6) codes containing the all-one vector

It is shown that the covering radius of any binary linear (14, 6) code containing the all-one vector is at least 4. Since the minimum covering radius of a binary linear (14, 6) code is 3, this shows that in general the minimum of the covering radius is not achieved by codes containing the all-one vector.<
>