We propose a method to bound the syndrome entropy of linear block codes from their factor graph representation. It is specially suited for sparse graphs such as those of low density parity check codes. It is based on the ...

This paper aims at computing tight upper bounds for the maximum a posteriori threshold of low-density parity check codes in the asymptotic blocklength regime for the transmission over binary-input memoryless symmetricoutput ...

We study the behavior of a new family of nonlinear graph-based codes, previously introduced for compression of asymmetric binary memoryless sources, for the joint source-channel coding scenario in which the codewords are ...

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 ...

In this paper, a new power allocation and bit
loading policy is defined for those systems working with a preselected binary channel code and specific bit error rate (BER) requirements. It consists on the maximization of ...

In this document, the synchronization algorithms developed during the project are presented and simulated. The studied algorithms are designed for a QS-CDMA system operating in the low SNR regime, i.e., at low Es/No values ...