| 摘要 |
PROBLEM TO BE SOLVED: To provide a method for evaluating an error-correcting code for a data block of a finite size. SOLUTION: The error-correcting code is defined by a parity check matrix in which columns represent variable bits and rows represent parity bit, and represented as a bipartite graph having two parts. Until the number of nodes in the bipartite graph becomes less than a prescribed threshold, a single node in the bipartite graph is repeatedly renormalized. During repeated renormalization, a specified variable node is selected as a target node and a distance between the target node and the other node in the bipartite graph is measured. Next, when there is at least one leaf variable node, a leaf variable node farthest from that target node is renormalized. Otherwise, a leaf check node farthest from the target node is renormalized or variable node, having the fewst directly connected check codes farthest from the target node is normalized.
|
