By Topic

New lower bounds for binary covering codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dongfeng Li ; Dept. of Math., Guangdong Inst. of Technol., China ; Wende Chen

Lower bounds for K(n, R), the minimal number of codewords of any binary code of length n and covering radius R, are improved. The definition of multiexcess is introduced. A technique combining van Wee's (1991) method and linear inequalities for covering codes is used. A revised table for K(n, R) (n⩽33, R⩽10) is given

Published in:

Information Theory, IEEE Transactions on  (Volume:40 ,  Issue: 4 )