Non-linear graph-based codes for source coding

We introduce a new family of graph-based source codes that can be regarded as a nonlinear generalization of LDPC codes, and apply them to the compression of asymmetric binary memoryless sources. Simulation results and the application of density evolution show that the proposed family presents a performance very close to the theoretical limits, clearly outperforming schemes based on linear codes.