By Topic

Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations

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)
Feng, G.-L. ; Dept. of Comput. Sci. & Electr. Eng., Lehigh Univ., Bethlehem, PA, USA ; Tzeng, K.K.

The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm, and the authors' (1989) generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. The authors introduce a more general procedure which breaks away from this restriction and which can determine the, error locations from nonrecurrent dependence relations among the syndromes. It can decode many cyclic and BCH codes up to their actual minimum distance and is seen to be a generalization of the procedure introduced by W.W. Peterson and E.J. Weldon (1972)

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )