Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
From MaRDI portal
Publication:398959
DOI10.1007/s10623-014-9951-7zbMath1297.94129arXiv1404.3022OpenAlexW3102517494MaRDI QIDQ398959
Alexander Zeh, Johan Rosenkilde né Nielsen
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.3022
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Efficient list decoding of a class of algebraic-geometry codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- Factoring multivariate polynomials over finite fields
- Decoding of Reed Solomon codes beyond the error-correction bound
- On lattice reduction for polynomial matrices
- Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
- On the Average Complexity of Reed–Solomon List Decoders
- List Decoding for Binary Goppa Codes
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance
- An Interpolation Procedure for List Decoding Reed–Solomon Codes Based on Generalized Key Equations
- The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes
- On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes
This page was built for publication: Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
