By Topic

New covering codes from an ADS-like construction

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

2 Author(s)

A covering code construction is presented. Using this construction it is shown that t[52,39]=3, t[36,21]=4, t[58,32]=7, K(32,2)≤62·218, and K(62,5)≤31·237, where t[n,k] is the minimum covering radius among all binary [n,k] codes and K(n,R) is the minimum cardinality of a binary code of length n and covering radius R. Four new linear codes found by computer search are also given. These include a [23,9]5 code, a [32,8]10 code, a [51,41]2 code, and a [45,20]8 code.

Published in:

IEEE Transactions on Information Theory  (Volume:49 ,  Issue: 7 )