Improved decoding of Reed-Solomon and algebraic-geometry codes
From MaRDI portal
(Redirected from Publication:4503371)
Recommendations
Cited in
(only showing first 100 items - show all)- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Improvements on the Johnson bound for Reed-Solomon codes
- On error distance of Reed-Solomon codes
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Sudan-decoding generalized geometric Goppa codes.
- Gröbner basis solutions of constrained interpolation problems
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- A two-dimensional improvement for Farr-Gao algorithm
- Multi-point codes over Kummer extensions
- Improved power decoding of interleaved one-point Hermitian codes
- List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- New constructions for IPP codes
- Power decoding Reed-Solomon codes up to the Johnson radius
- A class of I.P.P. codes with efficient identification
- Noisy Chinese remaindering in the Lee norm
- Scalable secure storage when half the system is faulty
- Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
- Weighted Reed-Muller codes revisited
- On deep holes of standard Reed-Solomon codes
- Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- 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
- Separable collusion-secure multimedia codes
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Weight distributions for projective binary linear codes from Weil sums
- Multi-point codes from the GGS curves
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction
- An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric
- A matrix based list decoding algorithm for linear codes over integer residue rings
- List decoding of number field codes
- On deep holes of generalized Reed-Solomon codes
- Some results on deep holes of generalized projective Reed-Solomon codes
- Formally verified certificate checkers for hardest-to-round computation
- Decoding interleaved Reed-Solomon codes over noisy channels
- Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
- List-decoding Barnes-Wall lattices
- On Reed-Solomon codes
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- Computational aspects of retrieving a representation of an algebraic geometry code
- On multi-trial Forney-Kovalev decoding of concatenated codes
- Polynomial root finding over local rings and application to error correcting codes
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- Gröbner basis approach to list decoding of algebraic geometry codes
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction
- A weight-based characterization of the set of correctable error patterns under list-of-2 decoding
- A fuzzy vault scheme
- Noisy interpolation of sparse polynomials in finite fields
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Computing minimal interpolation bases
- On the evaluation codes given by simple \(\delta \)-sequences
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- scientific article; zbMATH DE number 1594297 (Why is no real title available?)
- Advances in the performance of Reed-Solomon codes
- scientific article; zbMATH DE number 1670663 (Why is no real title available?)
- The vanishing ideal of a finite set of points with multiplicity structures
- Explicit capacity-achieving list-decodable codes
- Almost separating and almost secure frameproof codes over q-ary alphabets
- List Decoding for Binary Goppa Codes
- Factors of low individual degree polynomials
- Wild McEliece
- Optimal Rate List Decoding via Derivative Codes
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- List decoding algorithms for certain concatenated codes
- On the error distance of extended Reed-Solomon codes
- A New Algorithm for Decoding Reed-Solomon Codes
- Parallel Hashing via List Recoverability
- On the Doubly Sparse Compressed Sensing Problem
- On the error-correcting radius of folded Reed-Solomon code designs
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- Algebraic soft-decision decoding of reed-solomon codes
- Extractor Codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- A Highly Scalable RFID Authentication Protocol
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- List decoding of repeated codes
- scientific article; zbMATH DE number 4008275 (Why is no real title available?)
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- scientific article; zbMATH DE number 45703 (Why is no real title available?)
- Decoding beyond the designed distance for certain algebraic codes
- Multitrial decoding of concatenated codes using fixed thresholds
- scientific article; zbMATH DE number 503203 (Why is no real title available?)
- scientific article; zbMATH DE number 1974618 (Why is no real title available?)
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- scientific article; zbMATH DE number 2038702 (Why is no real title available?)
- Behavioral Models for List Decoding
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)
