Improved decoding of Reed-Solomon and algebraic-geometry codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
- Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
- Explicit capacity-achieving list-decodable codes
- Scalable public-key tracing and revoking
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Theory of Cryptography
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Computational aspects of retrieving a representation of an algebraic geometry code
- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Generic interpolation polynomial for list decoding
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- Bounds on the List-Decoding Radius of Reed--Solomon Codes
- List decoding codes on Garcia-Stichtenoth tower using Gröbner basis
- Multi-point codes from the GGS curves
- Gröbner basis approach to list decoding of algebraic geometry codes
- Advances in the performance of Reed-Solomon codes
- A fuzzy vault scheme
- Extractor Codes
- A Highly Scalable RFID Authentication Protocol
- Coding and Cryptography
- Gröbner bases and generalized Padé approximation
- New constructions for IPP codes
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- List-decoding Barnes-Wall lattices
- Parallel Hashing via List Recoverability
- On representations of algebraic-geometry codes
- Multitrial decoding of concatenated codes using fixed thresholds
- Key equations for list decoding of Reed-Solomon codes and how to solve them
- scientific article; zbMATH DE number 45703 (Why is no real title available?)
- A matrix based list decoding algorithm for linear codes over integer residue rings
- Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
- A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
- List-Decoding with Double Samplers
- List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
- List decoding of Hermitian codes using Gröbner bases
- On application of algebraic geometry codes of \(L\)-construction in copy protection
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem
- Behavioral Models for List Decoding
- The vanishing ideal of a finite set of points with multiplicity structures
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
- scientific article; zbMATH DE number 4008275 (Why is no real title available?)
- Complexity of Decoding Positive-Rate Reed-Solomon Codes
- scientific article; zbMATH DE number 1974618 (Why is no real title available?)
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Decoding interleaved Reed-Solomon codes over noisy channels
- 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
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Finding smooth integers in short intervals using CRT decoding
- Generalized Sudan’s List Decoding for Order Domain Codes
- Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
- Decoding Reed-Solomon codes beyond (d-1)/2 and zeros of multivariate polynomials
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- scientific article; zbMATH DE number 1594297 (Why is no real title available?)
- Optimal Rate List Decoding via Derivative Codes
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- A weight-based characterization of the set of correctable error patterns under list-of-2 decoding
- Privacy-preserving verifiable delegation of polynomial and matrix functions
- List decoding of wavelet codes
- Factors of low individual degree polynomials
- List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- List decoding of number field 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
- High-rate codes with sublinear-time decoding
- Computing minimal interpolation bases
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- A New Algorithm for Decoding Reed-Solomon Codes
- On the Doubly Sparse Compressed Sensing Problem
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Polynomial root finding over local rings and application to error correcting codes
- Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Multi-point codes over Kummer extensions
- List decoding of maximal order codes over number fields
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Weighted Reed-Muller codes revisited
- Noisy Chinese remaindering in the Lee norm
- On the error distance of extended Reed-Solomon codes
- Decoding of redundant residue polynomial codes using Euclid's algorithm
- scientific article; zbMATH DE number 820512 (Why is no real title available?)
- Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes
- Pseudorandom generators without the XOR lemma
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
- Algebraic soft-decision decoding of reed-solomon codes
- On some computations on sparse polynomials
- Separable collusion-secure multimedia codes
- Noisy interpolation of sparse polynomials in finite fields
- Efficient list decoding of a class of algebraic-geometry codes
- Improvements on the Johnson bound for Reed-Solomon codes
- On deep holes of standard Reed-Solomon codes
- Quasioptimal methods of correlational reception of Reed-Solomon codes
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- Scalable secure storage when half the system is faulty
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)
