By Topic

Low complexity maximum-likelihood decoding of product 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

1 Author(s)
O. Al-Askary ; Dept. of Electr. Eng., Linkpingsuniv., Linkping, Sweden

Many block codes can be represented as an intersection of two or more easily decoded codes. We present a new decoding algorithm for decoding product codes that utilizes this property. It will be shown that this algorithm is maximum-likelihood decoding. The complexity of the algorithm depends on the decoding complexity of the constituent codes and the quality of the channel

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference: