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

On maximum likelihood soft-decision decoding of binary linear 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
$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

3 Author(s)
Lous, N.J.C. ; Eindhoven Univ. of Technol., Netherlands ; Bours, P.A.H. ; Van Tilborg, H.C.A.

Two new implementations of a maximum-likelihood soft-decision decoding algorithm for binary linear codes are derived. Instead of checking only error patterns yielding a codeword when added to the rounded-off version of the received vector, these implementations principally consider all possible column patterns. Compared to known implementations, this allows a more efficient use of branching and bounding techniques

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 1 )