Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A bit-flipping (BF) algorithm is a decoding algorithm for LDPC codes that can be efficiently implemented by electronic circuits. Although its error correcting performance is rather poor, we show that a BF algorithm with bias terms has good error correcting performance. We also introduce two more parameters to improve the performance further. We also propose a variant of candidate bit based BF (CBBF) algorithm by introducing bias terms. We see that these algorithms having bias terms exhibit very good error correcting performances.