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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 915; S. 26 - 44
Hauptverfasser:	Velasquez, Alvaro, Subramani, K., Wojciechowski, Piotr
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 14.05.2022
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!