Abstract
For linear block codes correcting both errors and erasures, efficient decoding can be established by 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. Typically, these parity-check matrices have redundant rows. To reduce decoding complexity, parity-check matrices with small number of rows are preferred. The minimum number of rows in a parity-check matrix separating all erasure sets of size at most l is called the lth separating redundancy. In this paper, new upper bounds on the separating redundancy are presented.
Original language | English |
---|---|
Title of host publication | Proceedings of the 30th Symposium on Information Theory in the Benelux |
Subtitle of host publication | Eindhoven, The Netherlands, May 28-29, 2009 |
Place of Publication | Eindhoven, The Netherlands |
Publisher | Werkgemeenschap voor Informatie- en Communicatietheorie (WIC) |
Pages | 209-216 |
Number of pages | 8 |
ISBN (Print) | 978-90-386-1852-4 |
Publication status | Published - 28 May 2009 |
Event | 30th WIC Symposium on Information Theory in the Benelux 2009 - Eindhoven, Netherlands Duration: 28 May 2009 → 29 May 2009 Conference number: 30 |
Conference
Conference | 30th WIC Symposium on Information Theory in the Benelux 2009 |
---|---|
Country | Netherlands |
City | Eindhoven |
Period | 28/05/09 → 29/05/09 |
Keywords
- IR-75908
- EWI-19549
- METIS-275917