Pages that link to "Item:Q3280459"
From MaRDI portal
The following pages link to Polynomial Codes Over Certain Finite Fields (Q3280459):
Displaying 50 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)
- Binding cryptographic keys into biometric data: optimization (Q1995355) (← links)
- Simultaneous rational function reconstruction with errors: handling multiplicities and poles (Q2100064) (← links)
- Non-malleability against polynomial tampering (Q2102059) (← links)
- Noisy beeping networks (Q2105415) (← links)
- Testing equality under the local broadcast model (Q2117734) (← links)
- Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta ]}{ \langle u^2 \rangle} \) (Q2124648) (← links)
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- New Galois hulls of generalized Reed-Solomon codes (Q2168940) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- A library for formalization of linear error-correcting codes (Q2209551) (← links)
- Toy models of holographic duality between local Hamiltonians (Q2273380) (← links)
- A new minimize matrix computation coding method for distributed storage systems (Q2298412) (← links)
- An improved analysis of least squares superposition codes with Bernoulli dictionary (Q2303504) (← links)
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices (Q2310392) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- Self-repairing codes (Q2340045) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Zigzag decodable codes: linear-time erasure codes with applications to data storage (Q2402361) (← links)
- The basics of bases (Q2431396) (← links)
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes (Q2448068) (← links)
- A coding scheme that increases the code rate (Q2514072) (← links)
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- MDS coding is better than replication for job completion times (Q2661596) (← links)
- Measure-resend authenticated semi-quantum key distribution with single photons (Q2679046) (← links)
- Bounds in the Lee metric and optimal codes (Q2689354) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- KVaC: key-value commitments for blockchains and beyond (Q2691607) (← links)
- Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
