By Topic

On the covering radius of binary [14, 6] codes containing the all-one vector

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

3 Author(s)
S. M. Dodunekov ; Inst. of Math., Bulgarian Acad. of Sci., Sofia, Bulgaria ; K. N. Manev ; V. D. Tonchev

It is shown that the covering radius of any binary linear [14, 6] code containing the all-one vector is at least 4. Since the minimum covering radius of a binary linear [14, 6] code is 3, this shows that in general the minimum of the covering radius is not achieved by codes containing the all-one vector

Published in:

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