activity
20172019
most citedImproved Power Decoding of One-Point Hermitian Codes

1 citations · 3 across the 5 of their papers we have counts for

collaborators

6 papers

cs.IT20191 cited

Invariants and Inequivalence of Linear Rank-Metric Codes

Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an i…

cs.IT20191 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.IT2018

Improved Power Decoding of Interleaved One-Point Hermitian Codes

Sven Puchinger, Johan Rosenkilde, Irene Bouw

We propose a new partial decoding algorithm for -interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to $1-(\tfrac{k+g…

cs.IT2017

On the Success Probability of Decoding (Partial) Unit Memory Codes

Sven Puchinger, Sven Müelich, Martin Bossert

In this paper, we derive analytic expressions for the success probability of decoding (Partial) Unit Memory codes in memoryless channels. An applications of this result is that the…

cs.IT20171 cited

Improved Power Decoding of One-Point Hermitian Codes

Sven Puchinger, Irene Bouw, Johan Rosenkilde né Nielsen

We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami--Sudan decoder. Simulations suggest that…

cs.IT2017

Multi-Block Interleaved Codes for Local and Global Read Access

Yuval Cassuto, Evyatar Hemo, Sven Puchinger +1

We define multi-block interleaved codes as codes that allow reading information from either a small sub-block or from a larger full block. The former offers faster access, while th…