Pages that link to "Item:Q3280459"

The following pages link to Polynomial Codes Over Certain Finite Fields (Q3280459):

Displaying 19 items.

• Recovering erasures by using MDS codes over extension alphabets (Q258876) (← links)
• A characterization of MDS codes that have an error correcting pair (Q285480) (← links)
• Simple algorithms for decoding systematic Reed-Solomon codes (Q356717) (← links)
• Optimal quantum error correcting codes from absolutely maximally entangled states (Q4610173) (← links)
• Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes (Q4633757) (← links)
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
• Fractal mathematical over extended finite fields Fp[x]/(f(x)) (Q5027750) (← links)
• On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
• Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
• Clique-Based Neural Associative Memories with Local Coding and Precoding (Q5380554) (← links)
• (Q5875528) (← links)
• Interpolation for Brill–Noether curves (Q6084152) (← links)
• Densities of codes of various linearity degrees in translation-invariant metric spaces (Q6130607) (← links)
• Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius (Q6156027) (← links)
• Singleton-type bounds for list-decoding and list-recovery, and related results (Q6187335) (← links)
• A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes (Q6188418) (← links)
• Some new classes of additive MDS and almost MDS codes over finite fields (Q6191099) (← links)
• Private information retrieval from locally repairable databases with colluding servers (Q6495859) (← links)