English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Recently there has been interest in the construction of small parity-check sets for iterative decoding of the Hamming code with the property that each uncorrectable (or stopping) set of size three is the support of a codeword and hence uncorrectable anyway. Here we reformulate and generalize the problem and improve on this construction. We show that a parity-check collection that corrects all correctable erasure patterns of size m for the Hamming code with codimension r provides, in fact, for all codes of codimension r a corresponding "generic" parity-check collection with this property. This leads in a natural way to a necessary and sufficient condition for such generic parity-check collections. We use this condition to construct a generic parity-check collection for codes of codimension r correcting all correctable erasure patterns of size at most m, for all r and mlesr, thus generalizing the known construction for m=3. Then we discuss optimality of our construction and show that it can be improved for mges3 and r large enough. Finally, we discuss some directions for further research

On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size