New Upper Bounds on the Separating Redundancy of Linear Block Codes

Minh Tri Ngo, Jos H. Weber, Khaled A.S. Abdel-Ghaffar

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    10 Downloads (Pure)

    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 languageEnglish
    Title of host publicationProceedings of the 30th Symposium on Information Theory in the Benelux
    Subtitle of host publicationEindhoven, The Netherlands, May 28-29, 2009
    Place of PublicationEindhoven, The Netherlands
    PublisherWerkgemeenschap voor Informatie- en Communicatietheorie (WIC)
    Pages209-216
    Number of pages8
    ISBN (Print)978-90-386-1852-4
    Publication statusPublished - 28 May 2009
    Event30th WIC Symposium on Information Theory in the Benelux 2009 - Eindhoven, Netherlands
    Duration: 28 May 200929 May 2009
    Conference number: 30

    Conference

    Conference30th WIC Symposium on Information Theory in the Benelux 2009
    CountryNetherlands
    CityEindhoven
    Period28/05/0929/05/09

    Keywords

    • IR-75908
    • EWI-19549
    • METIS-275917

    Fingerprint Dive into the research topics of 'New Upper Bounds on the Separating Redundancy of Linear Block Codes'. Together they form a unique fingerprint.

    Cite this