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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 915; s. 26 - 44
Hlavní autori:	Velasquez, Alvaro, Subramani, K., Wojciechowski, Piotr
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 14.05.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!