Abstract
A modified lower bound for binary codes with covering radius one is derived. Let K/sub q/(n,R) denote the minimum cardinality of a q-ary code with covering radius R. The new bound shows that K/sub 2/(11,1)>or=177 and that K/sub 2/(17,1)>or=7391, improvements of the best lower bounds known. The authors also generalize a known lower bound for binary codes to the case of arbitrary q. For q=3, this simple bound improves the best lower bounds known in several cases. An updated version of a table for K/sub 3/(n,R) is included.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
