The following pages link to Mary Wootters (Q464238):
Displaying 47 items.
- Configuration spaces of convex and embedded polygons in the plane (Q464239) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- Can we access a database both locally and privately? (Q1690289) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Hermitian-lifted codes (Q2657135) (← links)
- Strategic Classification (Q2800558) (← links)
- It'll Probably Work Out (Q2989042) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Repairing Reed-Solomon Codes (Q4589401) (← links)
- (Q4607923) (← links)
- Linear-Time Erasure List-Decoding of Expander Codes (Q4958269) (← links)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q4963923) (← links)
- Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns (Q4963966) (← links)
- Superbridge and bridge indices for knots (Q4992346) (← links)
- Locality via Partially Lifted Codes (Q5002648) (← links)
- Embedded Index Coding (Q5003669) (← links)
- Improved List-Decodability of Random Linear Binary Codes (Q5003673) (← links)
- (Q5009547) (← links)
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity (Q5020732) (← links)
- Threshold Rates for Properties of Random Codes (Q5030333) (← links)
- Bounds for List-Decoding and List-Recovery of Random Linear Codes (Q5030334) (← links)
- (Q5089160) (← links)
- Local List Recovery of High-Rate Tensor Codes and Applications (Q5117374) (← links)
- (Q5161577) (← links)
- 1-Bit matrix completion (Q5177868) (← links)
- On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing (Q5211391) (← links)
- Blind Joint MIMO Channel Estimation and Decoding (Q5223946) (← links)
- Repairing Multiple Failures for Scalar MDS Codes (Q5223960) (← links)
- One-bit compressive sensing of dictionary-sparse signals (Q5229762) (← links)
- Every list-decodable code for high noise has abundant near-optimal rate puncturings (Q5259612) (← links)
- Local Correctability of Expander Codes (Q5326590) (← links)
- Repairing Reed-solomon codes (Q5361831) (← links)
- New constructions of RIP matrices with fast multiplication and fewer rows (Q5384073) (← links)
- On the list decodability of random linear codes with large error rates (Q5495857) (← links)
- Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q5875494) (← links)
- (Q5875503) (← links)
- (Q6084352) (← links)
- Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
- (Q6126310) (← links)
- (Q6126363) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)
- Improved list-decodability of random linear binary codes (Q6296851) (← links)
- Unconstraining graph-constrained group testing (Q6306514) (← links)
- Sharp threshold rates for random codes (Q6348784) (← links)
- High-probability list-recovery, and applications to heavy hitters (Q6560849) (← links)
- Viderman's algorithm for quantum LDPC codes (Q6645447) (← links)
- Repairing Reed-Solomon codes over prime fields via exponential sums (Q6670281) (← links)
