@inproceedings{d0103d804cee4a598e8e0efce73590f6,

title = "On decoding failure probabilities for linear block codes on the binary erasure channel",

abstract = "It has been claimed that the performance of a linear block code under iterative decoding on the binary erasure channel is determined by the stoppin gdistance, i.e., the size of hte smallest non-empty stopping set in the associated Tanner graph. Indeed, this is true from the perspective of code word retrieval. However, we show that with respect to the retrieval of just the information bits within the code word, the stopping distance may not be main performance indicator since the smallest non-empty stopping sets might not hit the information set of bits carrying the information for a fixed code with a fixed decoder.",

keywords = "conference contrib. refereed, Conf.proc. > 3 pag",

author = "JH Weber and KAS Abdel-Ghaffar",

year = "2006",

language = "Undefined/Unknown",

isbn = "1442400686",

publisher = "IEEE ",

pages = "24--28",

editor = "s.n.",

booktitle = "ITW'06: Proceedings of 2006 IEEE information theory workshop",

address = "United States",

note = "null ; Conference date: 22-10-2006 Through 26-10-2006",

}