activity
20172022
most citedAchievable Rates of Concatenated Codes in DNA Storage under Substitution Errors

1 citations · 4 across the 10 of their papers we have counts for

collaborators
Showing cs.ITShow all

31 papers · 1 filter

cs.IT2022

Rank-Metric Codes and Their Applications

Hannes Bartz, Lukas Holzbaur, Hedongliang Liu +3

The rank metric measures the distance between two matrices by the rank of their difference. Codes designed for the rank metric have attracted considerable attention in recent years…

cs.IT2022

Coding and Bounds for Partially Defective Memory Cells

Haider Al Kim, Sven Puchinger, Ludo Tolhuizen +1

This paper considers coding for so-called partially stuck (defect) memory cells. Such memory cells can only store partial information as some of their levels cannot be used fully d…

cs.IT2022

List Decoding of 2-Interleaved Binary Alternant Codes

Chih-Chiang Huang, Hedongliang Liu, Lukas Holzbaur +2

This paper is concerned with list decoding of -interleaved binary alternant codes. The principle of the proposed algorithm is based on a combination of a list decoding algorithm…

cs.IT2021

Correctable Erasure Patterns in Product Topologies

Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1

Locality enables storage systems to recover failed nodes from small subsets of surviving nodes. The setting where nodes are partitioned into subsets, each allowing for local recove…

cs.IT2021

Bounds on List Decoding of Linearized Reed-Solomon Codes

Sven Puchinger, Johan Rosenkilde

Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Re…

cs.IT2021

Efficient Decoding of Gabidulin Codes over Galois Rings

Sven Puchinger, Julian Renner, Antonia Wachter-Zeh +1

This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndr…