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

DOI10.1109/TIT.2009.2025573zbMath1367.94261OpenAlexW2156660752MaRDI QIDQ4973982

Eirik Rosnes, Øyvind Ytrehus

Publication date: 8 August 2017

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

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Channel models (including quantum) in information and communication theory (94A40) Boolean and Hadamard matrices (15B34)

Related Items (2)

On the complexity of and solutions to the minimum stopping and trapping set problems ⋮ Effect of one redundant parity-check equation on the stopping distance

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