Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”

DOI10.1109/TIT.2011.2171531zbMath1365.94650OpenAlexW2076838340MaRDI QIDQ5272157

Øyvind Ytrehus, Martin Tomlinson, Eirik Rosnes, Marcel A. Ambroze

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2011.2171531

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (1)

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

This page was built for publication: Addendum to “An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices”