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

IEEE International Symposium on Information Theory (ISIT)

Decoding algorithms with maximum error correction

W.E. Stark, Amer A. Hassan

Published Dec 17, 2002• 1 citation
Publisher

Abstract

Decoding algorithms with reliability information are of considerable interest in error control coding. Such information when available and when properly used increases the error correcting capability of the decoder. We find decoding algorithms that use soft decision with optimal error correcting capability for fixed constraints on decoder complexity.>

DOI
10.1109/isit.1994.394617

Related papers

A unified method for evaluating the error-correction radius of reliability-based soft-decision algorithms for linear block codes

M.P.C. Fossorier, Shu Lin

This paper presents a unified method for evaluating the error-correction radii of many reliability-based soft-decision decoding algorithms for binary linear block codes. Based on this unified method, these decoding algorithms as well as their potential improvements can be compared directly. The error-correction radius for each of these decoding algorithms is determined by finding the closest point on the boundary of the decision region of the soft-decision decoder to the transmitted signal sequence. It is shown that this problem can be formulated as a constrained optimization problem. Although no general closed-form expression is possible, a simple algorithm that always converges to the optimum solution of this optimization problem is presented. Based on these results, the error-correction radii of some well-known reliability-based soft-decision decoding algorithms are revisited and compared.

IEEE Transactions on Information Theory•Mar 1, 1998•31 citations

Asymptotically optimal soft decision decoding algorithms for Hamming codes

C.-E.W. Sundberg

Asymptotically optimal soft decision decoding algorithms for d = 3 and d = 4 Hamming codes are given and analysed. Only error sequences with probability exponent larger than that of maximum-likelihood decoding are corrected. Upper bounds on the block error probability for the Gaussian channel are given.

Electronics Letters•Jan 20, 1977•7 citations

Soft-decision majority decoding of Reed-Muller codes

Ilya I. Dumer, R.E. Krichevskiy

We present a new soft-decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of 2/sup m/ transmitted symbols are recalculated into the reliabilities of 2/sup m-r/ parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft-decision algorithm outperforms its conventional hard-decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output error probability. For fixed code rate R and m/spl rarr//spl infin/, our algorithm increases almost 2/sup r/2/ times the correcting capability of soft-decision bounded distance decoding.

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

Reliability-based syndrome decoding of linear block codes

M.P.C. Fossorier, Shu Lin, Jakov Snyders

In this correspondence, various aspects of reliability-based syndrome decoding of binary codes are investigated. First, it is shown that the least reliable basis (LRB) and the most reliable basis (MRB) are dual of each other. By exploiting this duality, an algorithm performing maximum-likelihood (ML) soft-decision syndrome decoding based on the LRB is presented. Contrarily to previous LRB-based ML syndrome decoding algorithms, this algorithm is more conveniently implementable for codes whose codimension is not small. New sufficient conditions for optimality are derived. These conditions exploit both the ordering associated with the LRB and the structure of the code considered. With respect to MRR-based sufficient conditions, they present the advantage of requiring no soft information and thus can be preprocessed and stored. Based on these conditions, low-complexity soft-decision syndrome decoding algorithms for particular classes of codes are proposed. Finally, a simple algorithm is analyzed. After the construction of the LRB, this algorithm computes the syndrome of smallest Hamming weight among o(K/sup i/) candidates, where K is the dimension of the code, for an order i of reprocessing. At practical bit-error rates, for codes of length N/spl les/128, this algorithm always outperforms any algebraic decoding algorithm capable of correcting up to t+1 errors with an order of reprocessing of at most 2, where t is the error-correcting capability of the code considered.

IEEE Transactions on Information Theory•Jan 1, 1998•31 citations

Comparative Analysis of Decoding Algorithms for Error Detecting & Correcting Systems

Abhijeet N. Chavan, Makarand Mohan Jadhav

The most important thing in any communication system is reliable transmission of data. To transmit the data through noisy channel, a redundancy is added before transmission which is known as channel coding. This transmitted data is decoded at the receiver with the help of soft decision decoding or hard decision decoding. Soft decision decoding can be classified as reliability based and code structure based decoding. Reliability in coding theory implies the probability of decoding the bit correctly. Most reliable bits give correct decoding output while less reliable bits are more prone to create errors. Iterative decoder accepts soft inputs-including a priori values-and delivers soft outputs that can he split into: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. The commonly used iterative decoder is sum product belief propagation algorithm. We are extending this analysis to the min-sum algorithm for polar codes. Using polar codes, the sum-product and min-sum algorithms are compared and simulation results are demonstrated.

CiiT international journal of wireless communication•Jan 1, 2016•0 citations

Fundamentals of Soft‐Decision Decoding

Mohammad Rowshan, Emanuele Viterbo

This chapter explores the critical role of decoding techniques in ensuring reliable communication over noisy channels. It discusses the role of various cost functions, which are essential for evaluating how closely a received signal corresponds to potential codewords. The chapter helps the reader to learn about the factors influencing the error rate of linear codes, providing a comprehensive understanding of how different parameters affect the reliability of communication. It explores advanced decoding techniques, including maximum a posteriori/maximum-likelihood (ML) decoding, reliability-based universal decoding, recursive decoding, message-passing algorithms, and tree/trellis-based search methods. Since the soft-decision ML decoding of the trivial codes is simple, a computationally efficient decoder for Reed–Muller codes can be obtained, based on computing the soft information for constituent codes and hard-decision on trivial codes.

Wiley eBooks•Oct 27, 2025•0 citations
Decoding algorithms with reliability information are of considerable interest in error control coding. Such information when available and when properly used increases the error correcting capability of the decoder. We find decoding algorithms that use soft decision with optimal error correcting capability for fixed constraints on decoder complexity.>
This paper presents a unified method for evaluating the error-correction radii of many reliability-based soft-decision decoding algorithms for binary linear block codes. Based on this unified method, these decoding algorithms as well as their potential improvements can be compared directly. The error-correction radius for each of these decoding algorithms is determined by finding the closest point on the boundary of the decision region of the soft-decision decoder to the transmitted signal sequence. It is shown that this problem can be formulated as a constrained optimization problem. Although no general closed-form expression is possible, a simple algorithm that always converges to the optimum solution of this optimization problem is presented. Based on these results, the error-correction radii of some well-known reliability-based soft-decision decoding algorithms are revisited and compared.
We present a new soft-decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of 2/sup m/ transmitted symbols are recalculated into the reliabilities of 2/sup m-r/ parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft-decision algorithm outperforms its conventional hard-decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output error probability. For fixed code rate R and m/spl rarr//spl infin/, our algorithm increases almost 2/sup r/2/ times the correcting capability of soft-decision bounded distance decoding.
In this correspondence, various aspects of reliability-based syndrome decoding of binary codes are investigated. First, it is shown that the least reliable basis (LRB) and the most reliable basis (MRB) are dual of each other. By exploiting this duality, an algorithm performing maximum-likelihood (ML) soft-decision syndrome decoding based on the LRB is presented. Contrarily to previous LRB-based ML syndrome decoding algorithms, this algorithm is more conveniently implementable for codes whose codimension is not small. New sufficient conditions for optimality are derived. These conditions exploit both the ordering associated with the LRB and the structure of the code considered. With respect to MRR-based sufficient conditions, they present the advantage of requiring no soft information and thus can be preprocessed and stored. Based on these conditions, low-complexity soft-decision syndrome decoding algorithms for particular classes of codes are proposed. Finally, a simple algorithm is analyzed. After the construction of the LRB, this algorithm computes the syndrome of smallest Hamming weight among o(K/sup i/) candidates, where K is the dimension of the code, for an order i of reprocessing. At practical bit-error rates, for codes of length N/spl les/128, this algorithm always outperforms any algebraic decoding algorithm capable of correcting up to t+1 errors with an order of reprocessing of at most 2, where t is the error-correcting capability of the code considered.
The most important thing in any communication system is reliable transmission of data. To transmit the data through noisy channel, a redundancy is added before transmission which is known as channel coding. This transmitted data is decoded at the receiver with the help of soft decision decoding or hard decision decoding. Soft decision decoding can be classified as reliability based and code structure based decoding. Reliability in coding theory implies the probability of decoding the bit correctly. Most reliable bits give correct decoding output while less reliable bits are more prone to create errors. Iterative decoder accepts soft inputs-including a priori values-and delivers soft outputs that can he split into: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. The commonly used iterative decoder is sum product belief propagation algorithm. We are extending this analysis to the min-sum algorithm for polar codes. Using polar codes, the sum-product and min-sum algorithms are compared and simulation results are demonstrated.
This chapter explores the critical role of decoding techniques in ensuring reliable communication over noisy channels. It discusses the role of various cost functions, which are essential for evaluating how closely a received signal corresponds to potential codewords. The chapter helps the reader to learn about the factors influencing the error rate of linear codes, providing a comprehensive understanding of how different parameters affect the reliability of communication. It explores advanced decoding techniques, including maximum a posteriori/maximum-likelihood (ML) decoding, reliability-based universal decoding, recursive decoding, message-passing algorithms, and tree/trellis-based search methods. Since the soft-decision ML decoding of the trivial codes is simple, a computationally efficient decoder for Reed–Muller codes can be obtained, based on computing the soft information for constituent codes and hard-decision on trivial codes.