Pages that link to "Item:Q4503371"
From MaRDI portal
The following pages link to Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371):
Displayed 50 items.
- Decoding interleaved Reed-Solomon codes over noisy channels (Q2373723) (← links)
- Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes (Q2383997) (← links)
- Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice (Q2384012) (← links)
- List-decoding Barnes-Wall lattices (Q2410678) (← links)
- On Reed-Solomon codes (Q2430341) (← links)
- Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension (Q2436580) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- On multi-trial Forney-Kovalev decoding of concatenated codes (Q2437957) (← links)
- Polynomial root finding over local rings and application to error correcting codes (Q2441447) (← links)
- 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)
- A fuzzy vault scheme (Q2491270) (← links)
- Noisy interpolation of sparse polynomials in finite fields (Q2491980) (← links)
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding (Q2516785) (← links)
- Computing minimal interpolation bases (Q2628323) (← links)
- On the evaluation codes given by simple \(\delta \)-sequences (Q2634585) (← links)
- ECC\(^2\): error correcting code and elliptic curve based cryptosystem (Q2663594) (← links)
- The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures (Q2799566) (← links)
- List Decoding for Binary Goppa Codes (Q3005580) (← links)
- Wild McEliece (Q3084251) (← 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 Doubly Sparse Compressed Sensing Problem (Q3460106) (← links)
- On the Error-Correcting Radius of Folded Reed–Solomon Code Designs (Q3460451) (← links)
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels (Q3503868) (← links)
- A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm (Q3540917) (← links)
- A Highly Scalable RFID Authentication Protocol (Q3634505) (← 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)
- (Q5002654) (← links)
- Soft decoding of short/medium length codes using ordered statistics for quantum key distribution (Q5037878) (← links)
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius (Q5041210) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- Amplification and Derandomization without Slowdown (Q5129234) (← links)
- List decoding of wavelet codes (Q5134251) (← links)
- LIST DECODING OF THE BIORTHOGONAL WAVELET CODE WITH PREDETERMINED CODE DISTANCE ON A FIELD OF ODD CHARACTERISTIC (Q5151203) (← links)
- ON APPLICATION OF ALGEBRAIC GEOMETRY CODES OF L-CONSTRUCTION IN COPY PROTECTION (Q5151265) (← links)
- ON LIST DECODING OF WAVELET CODES OVER FINITE FIELDS OF CHARACTERISTIC TWO (Q5151266) (← links)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results (Q5323002) (← links)
- Efficient List Decoding of Explicit Codes with Optimal Redundancy (Q5386076) (← links)
- Generalized Sudan’s List Decoding for Order Domain Codes (Q5386077) (← links)
- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding (Q5386098) (← links)
- On the Computation of Non-uniform Input for List Decoding on Bezerra-Garcia Tower (Q5386100) (← links)
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets (Q5429508) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Gröbner bases and generalized Padé approximation (Q5713240) (← links)
- List-Decoding with Double Samplers (Q5856152) (← links)