Pages that link to "Item:Q4503371"

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

Displaying 50 items.

• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets (Q300380) (← links)
• Factors of low individual degree polynomials (Q301529) (← links)
• On the error distance of extended Reed-Solomon codes (Q326319) (← links)
• List decoding of repeated codes (Q371249) (← links)
• Generalization of the Lee-O'Sullivan list decoding for one-point AG codes (Q390381) (← links)
• Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes (Q391770) (← links)
• Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes (Q398959) (← links)
• List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
• Multitrial decoding of concatenated codes using fixed thresholds (Q415715) (← links)
• Group homomorphisms as error correcting codes (Q490299) (← links)
• List decoding algorithm based on voting in Gröbner bases for general one-point AG codes (Q507148) (← links)
• Row reduction applied to decoding of rank-metric and subspace codes (Q510489) (← links)
• More results on the number of zeros of multiplicity at least \(r\) (Q512588) (← links)
• Efficient list decoding of a class of algebraic-geometry codes (Q540394) (← links)
• Generic interpolation polynomial for list decoding (Q661987) (← links)
• List decoding codes on Garcia-Stichtenoth tower using Gröbner basis (Q733507) (← links)
• List decoding of Hermitian codes using Gröbner bases (Q733508) (← links)
• Key masking using biometry (Q764394) (← links)
• Power error locating pairs (Q782853) (← links)
• Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019 (Q782984) (← links)
• Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes (Q849367) (← links)
• Nonbinary quantum error-correcting codes from algebraic curves (Q925007) (← links)
• Interpolation in list decoding of Reed-Solomon codes (Q927473) (← links)
• List decoding of Reed-Solomon codes from a Gröbner basis perspective (Q931140) (← links)
• Asymmetric information embedding (Q937224) (← links)
• Key equations for list decoding of Reed-Solomon codes and how to solve them (Q975823) (← links)
• An improved list decoding algorithm for the second order Reed-Muller codes and its applications (Q1009075) (← links)
• Improvements on the Johnson bound for Reed-Solomon codes (Q1028479) (← links)
• On error distance of Reed-Solomon codes (Q1042798) (← links)
• Sudan-decoding generalized geometric Goppa codes. (Q1400974) (← links)
• Gröbner basis solutions of constrained interpolation problems (Q1611921) (← links)
• Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
• A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes (Q1675777) (← links)
• A two-dimensional improvement for Farr-Gao algorithm (Q1691951) (← links)
• Multi-point codes over Kummer extensions (Q1692162) (← links)
• Improved power decoding of interleaved one-point Hermitian codes (Q1727371) (← links)
• New constructions for IPP codes (Q1781000) (← links)
• Power decoding Reed-Solomon codes up to the Johnson radius (Q1783708) (← links)
• A class of I.P.P. codes with efficient identification (Q1827562) (← links)
• Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
• Scalable secure storage when half the system is faulty (Q1854529) (← links)
• Weighted Reed-Muller codes revisited (Q1934223) (← links)
• On deep holes of standard Reed-Solomon codes (Q1934405) (← links)
• Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff (Q1945143) (← links)
• 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)