By Topic

Another upper bound on covering radius

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
$33 $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

1 Author(s)

A new upper bound on the covering radius of binary linear codes improves on previously known bounds for some codes. The bound is [W/2]+\rho_{2} , where W is one of the weights occurring among the codewords, and \rho_{2} is the covering radius of an associated code. Some comparisons with other bounds are made.

Published in:

IEEE Transactions on Information Theory  (Volume:29 ,  Issue: 3 )