By Topic

Lower bounds on t[n, k] from linear inequalities

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)
Zhen Zhang ; Dept. of Electr. Eng.-Syst., Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA ; Lo, C.

The linear inequality method for covering codes is used to improve the lower bounds of t[n, k], the smallest covering radius of any [n, k] binary linear code. To make better use of the strength of this method, the relation between the covering radius of a code and the minimum distance of its dual code is studied. The authors obtained 65 improved lower bounds for t[ n, k] within the range of n⩽64

Published in:

Information Theory, IEEE Transactions on  (Volume:38 ,  Issue: 1 )