On the complexity of and solutions to the minimum stopping and trapping set problems

In this paper, we discuss the problems of finding minimum stopping sets and trapping sets in Tanner graphs, using integer linear programming. These problems are important for establishing reliable communication across noisy channels. Indeed, stopping sets and trapping sets correspond to combinatoria...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 915; pp. 26 - 44
Main Authors:	Velasquez, Alvaro, Subramani, K., Wojciechowski, Piotr
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 14.05.2022
Subjects:	Exact exponential algorithm NP-complete Parameterized algorithm Stopping set Trapping set Trapping set Exact exponential algorithm Stopping set NP-complete Parameterized algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!