Improved power decoding of interleaved one-point Hermitian codes

DOI10.1007/S10623-018-0577-ZMaRDI QIDQ1727371zbMATH OpenOpenAlexWikidataFDO

Authors Sven Puchinger, Johan Rosenkilde, Irene I. Bouw

Publication date 20 February 2019

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.07006

zbMATH Keywords

power decodingcollaborative decodinginterleaved one-point Hermitian codes

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Abstract: 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-(frack+gn{)}^{frachh+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.

Recommendations

• Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
• Hermitian codes as generalized Reed-Solomon codes
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
• Cryptography and Coding
• Power decoding Reed-Solomon codes up to the Johnson radius

Cites work

• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• A generalized Euclidean algorithm for multisequence shift-register synthesis
• Approximate common divisors via lattices
• Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
• Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
• Cryptography and Coding
• Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
• Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
• Dependent rational points on curves over finite fields -- Lefschetz theorems and exponential sums
• Efficient list decoding of a class of algebraic-geometry codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Improved power decoding of interleaved one-point Hermitian codes
• List decoding of Hermitian codes using Gröbner bases
• New List Decoding Algorithms for Reed–Solomon and BCH Codes
• Performance analysis of a decoding algorithm for algebraic-geometry codes
• Power decoding Reed-Solomon codes up to the Johnson radius
• Sub-Quadratic Decoding of One-Point Hermitian Codes
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
• Unique Decoding of General AG Codes

Cited in

(5)

• Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
• Fast decoding of lifted interleaved linearized Reed-Solomon codes for multishot network coding
• Power error locating pairs
• Improved power decoding of interleaved one-point Hermitian codes
• Power decoding Reed-Solomon codes up to the Johnson radius

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Improved power decoding of interleaved one-point Hermitian codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1727371)