Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

An iterative probabilistic decoding algorithm for binary linear block codes beyond the half minimum distance

Miodrag J. Mihaljević

Published Jan 1, 1997• 1 citation
Publisher
DOI
10.1007/3-540-63163-1_19

Related papers

Optimality and Ruling-Out Conditions and Their Evaluation Methods for Soft-Decision Iterative Decoding Algorithms for Binary Linear Block Codes

元生 唐

•Mar 24, 2000•0 citations

A statistical decoding algorithm for linear block codes

Ankit Goyal

•Feb 22, 2012•0 citations

A method for convergence analysis of iterative probabilistic decoding

Miodrag J. Mihaljević, Jovan Dj. Golić

A novel analytical approach to performance evaluation of soft-decoding algorithms for binary linear block codes based on probabilistic iterative error correction is presented. A convergence condition establishing the critical noise rate below which the expected bit-error probability tends to zero is theoretically derived. It explains the capability of iterative probabilistic decoding of binary linear block codes with sparse parity-check matrices to correct, with probability close to one, error patterns with the number of errors (far) beyond half the code minimum distance. Systematic experiments conducted on truncated simplex codes seem to agree well with the convergence condition. The method may also be interesting for the theoretical analysis of the so-called turbo codes.

IEEE Transactions on Information Theory•Jan 1, 2000•15 citations

AN EFFICIENT ALGORITHM FOR SOFT-DECISION DECODING OF LINEAR BINARY BLOCK CODES

Yong Geol Shin, Choong Woong Lee

IEEE International Symposium on Circuits and Systems proceedings•Jan 1, 1989•0 citations

Probabilistic hard-decision table look-up decoding for binary block codes

M.A. El-Agamy, E. Munday

A probabilistic hard-decision decoding algorithm based on the weight distribution of binary block codes and the random error distribution in the channel is briefly described. It reduces the number of look-up iterations performed in the conventional exhaustive search table look-up minimum distance decoder.

Electronics Letters•Oct 25, 1984•1 citation

Recursive maximum-likelihood decoding algorithm for binary linear block codes

Shu Lin, Toru Fujiwara, Hiroshi Yamamoto +1 more

•Dec 1, 1997•0 citations
A novel analytical approach to performance evaluation of soft-decoding algorithms for binary linear block codes based on probabilistic iterative error correction is presented. A convergence condition establishing the critical noise rate below which the expected bit-error probability tends to zero is theoretically derived. It explains the capability of iterative probabilistic decoding of binary linear block codes with sparse parity-check matrices to correct, with probability close to one, error patterns with the number of errors (far) beyond half the code minimum distance. Systematic experiments conducted on truncated simplex codes seem to agree well with the convergence condition. The method may also be interesting for the theoretical analysis of the so-called turbo codes.