By Topic

Generation of matrices for determining minimum distance and decoding 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

4 Author(s)
K. K. Shen ; Dept. of Comput. Sci. & Electr. Eng., Lehigh Univ., Bethlehem, PA, USA ; C. Wang ; K. K. Tzeng ; B. -Z. Shen

A simple method based on Newton's identities and their extensions is presented for determining the actual minimum distance of cyclic codes. More significantly, it is shown that this method also provides a mechanism for generating the type of syndrome matrices needed by Feng and Tzeng's (see ibid., vol.40, p.1364-1374, Sept. 1994) new procedure for decoding cyclic and BCH codes up to their actual minimum distance. Two procedures for generating such matrices are given. With these procedures, we have generated syndrome matrices having only one class of conjugate syndromes on the minor diagonal for all binary cyclic codes of length n<63 and many codes of length 63⩽n⩽99. A listing of such syndrome matrices for selected codes of length n<63 is included. An interesting connection of the method presented to the shifting technique of van Lint (1986) and Wilson is also noted

Published in:

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