activity
20122017
most citedSub-quadratic Decoding of One-point Hermitian Codes

27 citations · 92 across the 11 of their papers we have counts for

collaborators

12 papers

cs.IT2017★ 21 cited

Further Generalisations of Twisted Gabidulin Codes

Sven Puchinger, Johan Rosenkilde né Nielsen, John Sheekey

We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, t…

cs.IT2016

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

Sven Puchinger, Sven Müelich, David Mödinger +2

We prove that Alekhnovich's algorithm can be used for row reduction of skew polynomial matrices. This yields an decoding algorithm for -Interl…

cs.SC2016★ 15 cited

Algorithms for Simultaneous Padé Approximations

Johan S. R. Nielsen, Arne Storjohann

We describe how to solve simultaneous Padé approximations over a power series ring for a field using operations in , where is the sought precis…

cs.IT2015★ 2 cited

Power Decoding Reed--Solomon Codes Up to the Johnson Radius

Johan Rosenkilde

Power decoding, or "decoding using virtual interleaving" is a technique for decoding Reed--Solomon codes up to the Sudan radius. Since the method's inception, it has been an open q…

cs.IT2014

Reduced List-Decoding of Reed--Solomon Codes Using Reliability Information

Mostafa Hosni Mohamed, Johan S. R. Nielsen, Martin Bossert

We decode Reed-Solomon codes using soft information provided at the receiver. The Extended Euclidean Algorithm (EEA) is considered as an initial step to obtain an intermediate resu…

cs.IT2014★ 2 cited

Fast Kötter-Nielsen-Høholdt Interpolation in the Guruswami-Sudan Algorithm

Johan S. R. Nielsen

The Kötter-Nielsen-Høholdt algorithm is a popular way to construct the bivariate interpolation polynomial in the Guruswami-Sudan decoding algorithm for Reed-Solomon codes. In this…