Improved power decoding of interleaved one-point Hermitian codes
From MaRDI portal
Publication:1727371
DOI10.1007/s10623-018-0577-zzbMath1421.94123arXiv1801.07006OpenAlexW2963315785WikidataQ128837236 ScholiaQ128837236MaRDI QIDQ1727371
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
Related Items (3)
Improved power decoding of interleaved one-point Hermitian codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Power error locating pairs
Uses Software
Cites Work
- Unnamed Item
- Efficient list decoding of a class of algebraic-geometry codes
- List decoding of Hermitian codes using Gröbner bases
- Improved power decoding of interleaved one-point Hermitian codes
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
- Power decoding Reed-Solomon codes up to the Johnson radius
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Approximate common divisors via lattices
- Sub-Quadratic Decoding of One-Point Hermitian Codes
- Unique Decoding of General AG Codes
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- A generalized Euclidean algorithm for multisequence shift-register synthesis
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Performance analysis of a decoding algorithm for algebraic-geometry codes
- Collaborative Decoding of Interleaved Reed–Solomon Codes and Concatenated Code Designs
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
- Cryptography and Coding
This page was built for publication: Improved power decoding of interleaved one-point Hermitian codes
