Abstract: The invention relates to an iterative method by message passing for decoding of an error correction code that can be displayed in a bipartite graph comprising a plurality of variable nodes and a plurality of check nodes. For each iteration in a plurality of decoding iterations of said method: variable nodes or check nodes are classified (720) as a function of the corresponding degrees of reliability of decoding information available in the neighbourhoods (Vn(d),Vm(d)) of these nodes, a node with a high degree of reliability being classified before a node with a low degree of reliability; each node thus classified (725) passes at least one message (?mn,?mn) to an adjacent node, in the order defined by said classification. The invention also relates to a computer program designed to implement said decoding method.

Abstract: The invention relates to an iterative decoding method of the message-passing type for decoding an error correcting code susceptible of representation by a bipartite graph including a plurality of variable nodes and a plurality of control nodes, said messages being expressed in terms of a log likelihood ratio. At each iteration of a plurality of decoding iterations, for each pair consisting of a variable node and a control node, a change is detected in the sign of the extrinsic information intended to be transmitted (?mntemp) as a message by said variable node to said control node relative to that transmitted (?mn) at the previous iteration, and in the event of a sign change, said extrinsic information is subjected to an amplitude reduction operation (Fred) before it is transmitted to the control node.