An LDPC (Low-Density Parity Check) code based on a control matrix represented by a Tanner bipartite graph includes 128 variable nodes of the graph and 64 constraint nodes of the graph, the code being wherein each of the constraint nodes of the graph is connected to 7 variable nodes of the graph; each of the cycles of the graph has a length greater than or equal to 6; the minimum distance of the code is equal to or greater than a predefined threshold for minimum distance.
展开▼