Pages that link to "Item:Q4503371"

The following pages link to Improved decoding of Reed-Solomon and algebraic-geometry codes (Q4503371):

Displaying 50 items.

• Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
• Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
• On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability (Q2031639) (← links)
• Separable collusion-secure multimedia codes (Q2044131) (← links)
• Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
• Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
• Weight distributions for projective binary linear codes from Weil sums (Q2130887) (← links)
• Multi-point codes from the GGS curves (Q2176293) (← links)
• Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
• An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric (Q2200525) (← links)
• A matrix based list decoding algorithm for linear codes over integer residue rings (Q2229499) (← links)
• List decoding of number field codes (Q2249795) (← links)
• On deep holes of generalized Reed-Solomon codes (Q2335176) (← links)
• Some results on deep holes of generalized projective Reed-Solomon codes (Q2335326) (← links)
• Formally verified certificate checkers for hardest-to-round computation (Q2352500) (← links)
• 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 weight-based characterization of the set of correctable error patterns under list-of-2 decoding (Q2470814) (← 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)
• Advances in the performance of Reed-Solomon codes (Q2732700) (← links)
• On representations of algebraic-geometric codes for list decoding (Q2753940) (← 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)
• List decoding algorithms for certain concatenated codes (Q3191984) (← links)
• A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← 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)
• List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings (Q3546497) (← links)
• Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings (Q3546498) (← links)