By Topic

On the covering radius of binary, linear codes meeting the Griesmer bound

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

3 Author(s)

Let g(k, d) = \sum _{i=0}^{k-1} \lceil d / 2^{i} \rceil . By the Griesmer bound, n \geq g(k, d) for any binary, linear [n, k, d] code. Let s = \lceil d / 2^{k-1} \rceil . Then, s can be interpreted as the maximum number of occurrences of a column in the generator matrix of any code with parameters [g(k, d), k, d] . Let \rho be the covering radius of a [g(k, d), k, d] code. It will be shown that \rho \leq d - \lceil s / 2 \rceil . Moreover, the existence of a [g(k, d), k, d] code with \rho = d - \lceil s / 2 \rceil is equivalent to the existence of a [g(k + 1, d), k + 1, d] code. For s \leq 2 , all [g(k,d),k,d] codes with \rho = d - \lceil s / 2 \rceil are described, while for s > 2 a sufficient condition for their existence is formulated.

Published in:

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