@inproceedings{467ca77810424708ae16b7feaee0fcbf,

title = "An upper bound on the separating redundancy of linear block codes",

abstract = "Linear block codes over noisy channels causing both erasures and errors can be decoded by deleting the erased symbols and decoding the resulting vector with respect to a punctured code and then retrieving the erased symbols. This can be accomplished using separating parity-check matrices. For a given maximum number of correctable erasures, such matrices yield parity-check equations that do not check any of the erased symbols and which are sufficient to characterize all punctured codes corresponding to this maximum number of erasures. Separating parity-check matrices typically have redundant rows. An upper bound on the minimum number of rows in separating parity-check matrices, which is called the separating redundancy, is derived which proves that the separating redundancy tends to behave linearly as a function of the code length.",

keywords = "conference contrib. refereed, Vakpubl., Overig wet. > 3 pag",

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

year = "2010",

language = "English",

isbn = "978-1-4244-7892-7",

publisher = "IEEE Society",

pages = "1173--1177",

booktitle = "An upper bound on the separating redundancy of linear block codes",

note = "Information Theory Proceedings (ISIT) 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}