By Topic

On the minimum distance of some quadratic residue codes (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

2 Author(s)

We find the minimum distances of the binary (113, 57) , and ternary (37, 19), (61, 31), (71, 36) , and (73, 37) quadratic residue codes and the corresponding extended codes. These distances are 15, 10, 11, 17 , and 17 , respectively, for the nonextended codes and are increased by one for the respective extended codes. We also characterize the minimum weight codewords for the (113, 57) binary code and its extended counterpart.

Published in:

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