Computing the Stopping Distance of a Tanner Graph is NP-hard

Krishnan, Murali K and Shankar, Priti (2007) Computing the Stopping Distance of a Tanner Graph is NP-hard. In: IEEE Transactions on Information Theory, 53 (6). pp. 2278-2280.

Preview

PDF NP.pdf Download (147kB)

Abstract

Two decision problems related to the computation of stopping sets in Tanner graphs are shown to be NP-complete. It follows as a consequence that there exists no polynomial time algorithm for computing the stopping distance of a Tanner graph unless P=NP.

Item Type:	Journal Article
Publication:	IEEE Transactions on Information Theory
Publisher:	IEEE
Additional Information:	Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords:	Tanner graph;stopping distance;NP-hardness;low-density parity-check (LDPC) codes.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	03 Jul 2008
Last Modified:	19 Sep 2010 04:46
URI:	http://eprints.iisc.ac.in/id/eprint/14734

Actions (login required)

View Item