## User login |
## C++C++ Source code ## RBP algorithm for lossy compression in reduced, ultrasparse GF(q) codes
This code implements a novel data compression technique for binary symmetric sources based on the cavity method over GF(q), the Galois Field of order q. We present a scheme of low complexity and near-optimal empirical performance. The compression step is based on a reduction of a sparse low-density parity-check code over GF(q) and is done through the so-called reinforced belief-propagation equations. These reduced codes appear to have a nontrivial geometrical modification of the space of codewords, which makes such compression computationally feasible. - By ab at 04/12/2012 - 12:40
- coding
- optimization
- probability
- statphys
- C++
- Read more
## Prize-Collecting Steiner Trees
The permission to use this software is granted by the authors, Alfredo |