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.
|Title of host publication||An upper bound on the separating redundancy of linear block codes|
|Place of Publication||Austin, Texax|
|Number of pages||5|
|Publication status||Published - 2010|
|Event||Information Theory Proceedings (ISIT) 2010 - Austin, Texax|
Duration: 13 Jun 2010 → 18 Jun 2010
|Conference||Information Theory Proceedings (ISIT) 2010|
|Period||13/06/10 → 18/06/10|
- conference contrib. refereed
- Vakpubl., Overig wet. > 3 pag
Abdel-Ghaffar, KAS., & Weber, JH. (2010). An upper bound on the separating redundancy of linear block codes. In An upper bound on the separating redundancy of linear block codes (pp. 1173-1177). IEEE Society.