Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On the Lin-Weldon majority-logic decoding algorithm for product 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
$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

1 Author(s)

It is shown that a majority-logic decoding algorithm proposed by Lin and Weldon for the product of an L -step and a one-step orthogonalizable code is incomplete when L is greater than unity. An improvement is presented to overcome this disadvantage in the binary case.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 4 )