Pages that link to "Item:Q3280459"

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

Displaying 37 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)
• E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation (Q371254) (← links)
• Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks (Q389368) (← links)
• A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
• Symmetric threshold multipath (STM): an online symmetric key management scheme (Q726168) (← links)
• Real-time optimized error protection assignment for scalable image and video over wireless channels (Q733687) (← links)
• On algorithms to find \(p\)-ordering (Q831740) (← links)
• Comparison of error protection methods for audio-video broadcast over DVB-H (Q836393) (← links)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
• On multiple burst-correcting MDS codes (Q891305) (← links)
• Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
• Bilinear forms over a finite field, with applications to coding theory (Q1254279) (← links)
• Interactive communication with unknown noise rate (Q1641020) (← links)
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring (Q1644851) (← links)
• The truncated and supplemented Pascal matrix and applications (Q1684516) (← links)
• A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes (Q1700979) (← links)
• Linear system security -- detection and correction of adversarial sensor attacks in the noise-free case (Q1737687) (← links)
• Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample (Q1943114) (← 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)
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← 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)