DeepAI AI Chat
Log In Sign Up

Improved Power Decoding of Interleaved One-Point Hermitian Codes

by   Sven Puchinger, et al.
Universität Ulm

We propose a new partial decoding algorithm for h-interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to 1-(k+gn)^h/h+1, where k is the dimension, n the length, and g the genus of the code. Simulation results for various parameters indicate that the new decoder achieves this maximal decoding radius with high probability. The algorithm is based on a recent generalization of Rosenkilde's improved power decoder to interleaved Reed-Solomon codes, does not require an expensive root-finding step, and improves upon the previous best decoding radius by Kampf at all rates. In the special case h=1, we obtain an adaption of the improved power decoding algorithm to one-point Hermitian codes, which for all simulated parameters achieves a similar observed failure probability as the Guruswami-Sudan decoder above the latter's guaranteed decoding radius.


page 1

page 2

page 3

page 4


List Decoding of 2-Interleaved Binary Alternant Codes

This paper is concerned with list decoding of 2-interleaved binary alter...

Error Decoding of Locally Repairable and Partial MDS Codes

In this work it is shown that locally repairable codes (LRCs) can be lis...

On Error Decoding of Locally Repairable and Partial MDS Codes

We consider error decoding of locally repairable codes (LRC) and partial...

Improved Power Decoding of Algebraic Geometry Codes

Power decoding is a partial decoding paradigm for arbitrary algebraic ge...

Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This article discusses the decoding of Gabidulin codes and shows how to ...

Fast Decoding of AG Codes

We present an efficient list decoding algorithm in the style of Guruswam...

Nearest neighbor decoding for Tardos fingerprinting codes

Over the past decade, various improvements have been made to Tardos' col...