By Topic

Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings

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)
Interlando, J.C. ; Dept. of Commun., DECOM/FEE/UNICAMP, Campinas, Brazil ; Palazzo, R., Jr.

We propose an extension of the Berlekamp-Massey (1969) algorithm for decoding BCH codes defined over integer residue rings and for synthesizing the shortest linear feedback shift register (LFSR) that will generate a given finite sequence of elements lying also in an integer residue ring

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994