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.
CitationMatas, D.; Lamarca, M.; García-Frías, J. Non-linear graph-based codes for source coding. A: IEEE Information Theory Workshop. "2009 IEEE Information Theory Workshop". 2009, p. 318-322.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com