By Topic

Minimum-distance bounds for binary linear codes

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)

This paper presents a table of upper and lower bounds ond_{max} (n,k), the maximum minimum distance over all binary, linear(n,k)error-correcting codes. The table is obtained by combining the best of the existing bounds ond_{max} (n,k)with the minimum distances of known codes and a variety of code-construction techniques.

Published in:

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