Improved decoding of Reed-Solomon and algebraic-geometry codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- scientific article; zbMATH DE number 820512 (Why is no real title available?)
- scientific article; zbMATH DE number 4008275 (Why is no real title available?)
- On the Doubly Sparse Compressed Sensing Problem
- Formally verified certificate checkers for hardest-to-round computation
- Separable collusion-secure multimedia codes
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- A two-dimensional improvement for Farr-Gao algorithm
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- Amplification and Derandomization without Slowdown
- Finding smooth integers in short intervals using CRT decoding
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- Improvements on the Johnson bound for Reed-Solomon codes
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- Some results on deep holes of generalized projective Reed-Solomon codes
- A matrix based list decoding algorithm for linear codes over integer residue rings
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Bounds on list decoding of MDS codes
- Noisy Chinese remaindering in the Lee norm
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- Decoding interleaved Reed-Solomon codes over noisy channels
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
- Scalable secure storage when half the system is faulty
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- Finding smooth integers in short intervals using CRT decoding
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials
- Generalized Sudan’s List Decoding for Order Domain Codes
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
- Multi-point codes over Kummer extensions
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
- High-rate codes with sublinear-time decoding
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- Some decoding applications of minimal realization
- Explicit capacity-achieving list-decodable codes
- Weight distributions for projective binary linear codes from Weil sums
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Polynomial root finding over local rings and application to error correcting codes
- Scalable public-key tracing and revoking
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Asymmetric information embedding
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Sudan-decoding generalized geometric Goppa codes.
- List decoding of number field codes
- Interpolation in list decoding of Reed-Solomon codes
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- Cryptography and Coding
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- List decoding algorithms for certain concatenated codes
- A New Algorithm for Decoding Reed-Solomon Codes
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Nonbinary quantum error-correcting codes from algebraic curves
- Pseudorandom generators without the XOR lemma
- On representations of algebraic-geometry codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Weighted Reed-Muller codes revisited
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Theory of Cryptography
- List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
- Gröbner basis solutions of constrained interpolation problems
- A fuzzy vault scheme
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- On deep holes of standard Reed-Solomon codes
- Key masking using biometry
- Extractor Codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- Improved power decoding of interleaved one-point Hermitian codes
- Multitrial decoding of concatenated codes using fixed thresholds
- Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019
- Power error locating pairs
- Noisy interpolation of sparse polynomials in finite fields
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- On some computations on sparse polynomials
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Efficient list decoding of a class of algebraic-geometry codes
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- scientific article; zbMATH DE number 1670663 (Why is no real title available?)
- List decoding of repeated codes
- On Reed-Solomon codes
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- scientific article; zbMATH DE number 1594297 (Why is no real title available?)
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- Behavioral Models for List Decoding
- List Decoding for Binary Goppa Codes
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Computing minimal interpolation bases
- Algebraic soft-decision decoding of reed-solomon codes
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Factors of low individual degree polynomials
- Coding and Cryptography
This page was built for publication: Improved decoding of Reed-Solomon and algebraic-geometry codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503371)
