@article{fa9095bddc9d43f282cc4b75ad9a1450,
title = "Addendum to {"}An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices{"}",
keywords = "Binary erasure channel, branch-and-bound, exhaustive stopping set enumeration, IEEE 802.16e, low-density parity-check (LDPC) code, minimum distance, stopping distance, stopping set, tree search, weight spectrum",
author = "E Rosnes and O Ytrehus and MA Ambroze and M Tomlinson",
year = "2012",
month = jan,
day = "5",
doi = "10.1109/TIT.2011.2171531",
language = "English",
volume = "58",
pages = "164--171",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",
}