Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On the complete decoding of constrained 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

2 Author(s)
Helberg, A.S.J. ; Cybern Lab., Rand Afrikaans Univ., Johannesburg, South Africa ; Ferreira, H.C.

A maximum-likelihood algorithm for devising complete decoders for constrained codes and an algorithm for calculating the resulting error multiplication probabilities are presented. These algorithms make it possible to reduce the error multiplication when decoding the symbols of constrained codes or the symbols of various combined error correcting, constrained coding schemes after reception over channels that introduce bit errors into the symbols

Published in:

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