The following pages link to Matching Vector Codes (Q3096097):
Displaying 16 items.
- A novel elementary construction of matching vectors (Q436582) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- (Q5009505) (← links)
- Proof of the Kakeya set conjecture over rings of integers modulo square-free N (Q5048441) (← links)
- (Q5090413) (← links)
- (Q5090443) (← links)
- (Q5090982) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- Erasures versus errors in local decoding and property testing (Q6074671) (← links)
