Optimal binary covering codes of length
โ
William D. Weakley
๐
Article
๐
2005
๐
John Wiley and Sons
๐
English
โ 144 KB
## Abstract The minimum size of a binary covering code of length __n__ and covering radius __r__ is denoted by __K__(__n__,__r__), and codes of this length are called optimal. For __j__โ>โ0 and __n__โ=โ2^__j__^, it is known that __K__(__n__,1)โ=โ2โยทโ__K__(__n__โ1,1)โ=โ2^__nโโโj__^. Say that two bin