activity
20112026
most citedCoding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions

22 citations · 81 across the 49 of their papers we have counts for

collaborators
Showing 2019Show all

10 papers · 1 filter

cs.IT2019

Error Correction for Partially Stuck Memory Cells

Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh

We present code constructions for masking partially stuck memory cells with levels and correcting additional random errors. The results are achieved by combining the method…

cs.IT2019

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

Julian Renner, Thomas Jerkovits, Hannes Bartz +3

We address the problem of decoding Gabidulin codes beyond their unique error-correction radius. The complexity of this problem is of importance to assess the security of some rank-…

cs.IT2019

Error Decoding of Locally Repairable and Partial MDS Codes

Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh

In this work it is shown that locally repairable codes (LRCs) can be list-decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error…

cs.IT2019★ 1 cited

Decoding High-Order Interleaved Rank-Metric Codes

Sven Puchinger, Julian Renner, Antonia Wachter-Zeh

This paper presents an algorithm for decoding homogeneous interleaved codes of high interleaving order in the rank metric. The new decoder is an adaption of the Hamming-metric deco…

cs.IT2019

On Error Decoding of Locally Repairable and Partial MDS Codes

Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh

We consider error decoding of locally repairable codes (LRC) and partial MDS (PMDS) codes through interleaved decoding. For a specific class of LRCs we investigate the success prob…

cs.IT2019

Clustering-Correcting Codes

Tal Shinkar, Eitan Yaakobi, Andreas Lenz +1

A new family of codes, called clustering-correcting codes, is presented in this paper. This family of codes is motivated by the special structure of data that is stored in DNA-base…