By Topic

New binary codes from a chain of cyclic 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
$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)
M. Grassl ; Inst. fur Algorithmen und Kognitive Syst., Karlsruhe Univ., Germany

Starting with a chain of cyclic linear binary codes of length 127, linear binary codes of lengths 129-167, and dimensions 30-50 are constructed. Some of these codes have a minimum distance exceeding the lower bound given in Brouwer's table

Published in:

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