By Topic

On two probabilistic decoding algorithms for 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

1 Author(s)
Zivkovic, M. ; Inst. of Appl. Math. & Electron., Beograd, Yugoslavia

A generalization of the Sullivan inequality (1967) on the ratio of the probability of a linear code to that of any of its cosets is proved. Starting from this inequality, a sufficient condition for successful decoding of linear codes by a probabilistic method is derived. A probabilistic decoding algorithm for low-density parity-check codes is also analyzed. This method of analysis enables one to estimate experimentally the probability of successful decoding for any given linear code and for any chosen family of parity-check sets. Using the example of a linear (512,100) code, the author illustrates the dependence of the successful probability on the channel noise level

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )