Pages that link to "Item:Q1361883"
From MaRDI portal
The following pages link to Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883):
Displaying 50 items.
- Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability (Q2448071) (← links)
- Gröbner basis approach to list decoding of algebraic geometry codes (Q2460910) (← links)
- Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction (Q2467321) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- Exploiting the cannibalistic traits of Reed-Solomon codes (Q2726172) (← links)
- The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures (Q2799566) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Maximum-likelihood decoding of Reed-Solomon codes is NP-hard (Q2921702) (← links)
- Error-Correcting Codes Against Chosen-Codeword Attacks (Q2953815) (← links)
- Optimal Rate List Decoding via Derivative Codes (Q3088129) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
- Power Decoding of Reed–Solomon Codes Revisited (Q3460479) (← links)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm (Q3540917) (← links)
- Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard (Q3546964) (← links)
- Exponential Error Bounds for Algebraic Soft-Decision Decoding of Reed–Solomon Codes (Q3547541) (← links)
- Decoding Folded Reed–Solomon Codes Using Hensel-Lifting (Q3652834) (← links)
- On the complexity of decoding Reed-Solomon codes (Corresp.) (Q4081130) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- Behavioral Models for List Decoding (Q4459999) (← links)
- (Q4474270) (← links)
- Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371) (← links)
- Efficient decoding of Reed-Solomon codes beyond half the minimum distance (Q4503508) (← links)
- A Decoding Approach to Reed–Solomon Codes from Their Definition (Q4577009) (← links)
- NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem (Q4581908) (← links)
- Repairing Reed-Solomon Codes (Q4589401) (← links)
- On some computations on sparse polynomials (Q5002654) (← links)
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution (Q5037878) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- (Q5092470) (← links)
- Nonlinear Repair of Reed-Solomon Codes (Q5096980) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- ON LIST DECODING OF WAVELET CODES OVER FINITE FIELDS OF CHARACTERISTIC TWO (Q5151266) (← links)
- An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes (Q5155704) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes (Q5281271) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- Repairing Reed-solomon codes (Q5361831) (← links)
- Efficient List Decoding of Explicit Codes with Optimal Redundancy (Q5386076) (← links)
- Generalized Sudan’s List Decoding for Order Domain Codes (Q5386077) (← links)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets (Q5429508) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Finding smooth integers in short intervals using CRT decoding (Q5894822) (← links)
- Theory of Cryptography (Q5898647) (← links)
- Fitting algebraic curves to noisy data (Q5917581) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
