Pages that link to "Item:Q3280459"
From MaRDI portal
The following pages link to Polynomial Codes Over Certain Finite Fields (Q3280459):
Displayed 16 items.
- 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)
- Real-time optimized error protection assignment for scalable image and video over wireless channels (Q733687) (← 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)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Bilinear forms over a finite field, with applications to coding theory (Q1254279) (← links)
- Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample (Q1943114) (← links)
- The basics of bases (Q2431396) (← links)
- Simplified High-Speed High-Distance List Decoding for Alternant Codes (Q3102792) (← links)
- AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS (Q3173477) (← links)
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) (Q3511179) (← links)
- Optimistic Erasure-Coded Distributed Storage (Q3540229) (← links)
- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems (Q5386085) (← links)
- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding (Q5386098) (← links)
- An application of information theory and error-correcting codes to fractional factorial experiments (Q5929958) (← links)