An upper bound on the separating redundancy of linear block codes

KAS Abdel-Ghaffar, JH Weber

    Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

    1 Citation (Scopus)

    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.
    Original languageEnglish
    Title of host publicationAn upper bound on the separating redundancy of linear block codes
    Place of PublicationAustin, Texax
    PublisherIEEE Society
    Pages1173-1177
    Number of pages5
    ISBN (Print)978-1-4244-7892-7
    Publication statusPublished - 2010
    EventInformation Theory Proceedings (ISIT) 2010 - Austin, Texax
    Duration: 13 Jun 201018 Jun 2010

    Publication series

    Name
    PublisherIEEE

    Conference

    ConferenceInformation Theory Proceedings (ISIT) 2010
    Period13/06/1018/06/10

    Keywords

    • conference contrib. refereed
    • Vakpubl., Overig wet. > 3 pag

    Fingerprint Dive into the research topics of 'An upper bound on the separating redundancy of linear block codes'. Together they form a unique fingerprint.

  • Cite this

    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.