On the upper bound on undetected error probability for LDPC code

Pavel Rybin, Victor Zyablov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper deals with the method of undetected error probability estimation for a low-density parity-check (LDPC) code under any given iterative decoding algorithm. We propose such modification of a given iterative decoding algorithm, that almost preserves a decoding failure exponent and decoding complexity of this algorithm. We obtain the upper bound on the undetected error probability for the modified algorithm. We show how to use the proposed method to estimate the undetected error probability of LDPC code under the belief propagation (BP) algorithm at the end of this paper.

Original languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3160-3164
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

Fingerprint

Dive into the research topics of 'On the upper bound on undetected error probability for LDPC code'. Together they form a unique fingerprint.

Cite this