By Topic

Binary codes with improved minimum weights (Corresp.)

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

1 Author(s)

A recent table of Helgert and Stinaff gives bounds for d_{\max }(n,k) , the maximum minimum distance over all binary linear (n,k) error-correcting codes, 1 \leq k \leq n \leq 127 . Twelve new codes are constructed which improve lower bounds in the table. Two methods are employed: the algebraic puncturing technique of Solomon and Stiffler and generation by combinatorial incidence matrices.

Published in:

IEEE Transactions on Information Theory  (Volume:22 ,  Issue: 2 )