67 citations · 262 across the 80 of their papers we have counts for
16 papers · 1 filter
Concatenated Codes for Recovery From Multiple Reads of DNA Sequences
Andreas Lenz, Issam Maarouf, Lorenz Welter +3
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic a…
Decoding of Interleaved Alternant Codes
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri +4
Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a…
On Software Implementation of Gabidulin Decoders
Johannes Kunz, Julian Renner, Georg Maringer +2
This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recent…
Information- and Coding-Theoretic Analysis of the RLWE Channel
Georg Maringer, Sven Puchinger, Antonia Wachter-Zeh
Several cryptosystems based on the \emph{Ring Learning with Errors} (RLWE) problem have been proposed within the NIST post-quantum cryptography standardization process, e.g., NewHo…
Partial MDS Codes with Regeneration
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD co…
Bounds and Code Constructions for Partially Defect Memory Cells
Haider Al Kim, Sven Puchinger, Antonia Wachter-Zeh
This paper considers coding for so-called partially stuck memory cells. Such memory cells can only store partial information as some of their levels cannot be used due to, e.g., we…
Almost Affinely Disjoint Subspaces
Hedongliang Liu, Nikita Polyanskii, Ilya Vorobyev +1
In this work, we introduce a natural notion concerning finite vector spaces. A family of -dimensional subspaces of , which forms a partial spread, is called almo…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer,…
Single-Deletion Single-Substitution Correcting Codes
Ilia Smagloy, Lorenz Welter, Antonia Wachter-Zeh +1
Correcting insertions/deletions as well as substitution errors simultaneously plays an important role in DNA-based storage systems as well as in classical communications. This pape…
Rateless Codes for Private Distributed Matrix-Matrix Multiplication
Rawad Bitar, Marvin Xhemrishi, Antonia Wachter-Zeh
We consider the problem of designing rateless coded private distributed matrix-matrix multiplication. A master server owns two private matrices and and wa…
Criss-Cross Insertion and Deletion Correcting Codes
Rawad Bitar, Lorenz Welter, Ilia Smagloy +2
This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an array can experience deletions of rows and…
Secrecy and Accessibility in Distributed Storage
Lukas Holzbaur, Stanislav Kruglik, Alexey Frolov +1
A distributed storage system (DSS) needs to be efficiently accessible and repairable. Recently, considerable effort has been made towards the latter, while the former is usually no…
Computational Code-Based Single-Server Private Information Retrieval
Lukas Holzbaur, Camilla Hollanti, Antonia Wachter-Zeh
A new computational private information retrieval (PIR) scheme based on random linear codes is presented. A matrix of messages from a McEliece scheme is used to query the server wi…
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
Julian Renner, Sven Puchinger, Antonia Wachter-Zeh +2
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring , where is a prime and is a positive integer. LRPC…
Partial MDS Codes with Local Regeneration
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where e…
On the Gap between Scalar and Vector Solutions of Generalized Combination Networks
Hedongliang Liu, Hengjia Wei, Sven Puchinger +2
We study scalar-linear and vector-linear solutions to the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer,…