Asymptotic MAP upper bounds for LDPC codes
Document typeConference report
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Rights accessRestricted access - publisher's policy
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 channels. While these bounds are already known, we propose a novel derivation based on a completely different approach: based solely on the concept of the chain rule and the conditional entropy, resorting to the concentration theorem for the code ensemble to compute the syndrome entropy with low complexity employing density evolution.
CitationMatas, D., Lamarca, M. Asymptotic MAP upper bounds for LDPC codes. A: IEEE International Symposium on Information Theory. "2016 IEEE International Symposium on Information Theory (ISIT 2016): Barcelona, Spain 10-15 July 2016". Barcelona: Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 2893-2897.