Pages that link to "Item:Q3191974"
From MaRDI portal
The following pages link to On the efficiency of local decoding procedures for error-correcting codes (Q3191974):
Displaying 50 items.
- A novel elementary construction of matching vectors (Q436582) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- An optimal lower bound for 2-query locally decodable linear codes (Q1045948) (← links)
- On decoding by error location and dependent sets of error positions (Q1199627) (← links)
- Non-interactive proofs of proximity (Q1745962) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Information hiding using matroid theory (Q2040985) (← links)
- Multi-value private information retrieval with colluding databases via trace functions (Q2053906) (← links)
- Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes (Q2272981) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- Enumerative coding for line polar Grassmannians with applications to codes (Q2363322) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes (Q2408282) (← links)
- Fast systematic encoding of multiplicity codes (Q2422714) (← links)
- On the locality of codeword symbols in non-linear codes (Q2440947) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Hermitian-lifted codes (Q2657135) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Sylvester-Gallai type theorems for approximate collinearity (Q2879416) (← links)
- Locally Decodable Codes for Edit Distance (Q2947534) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Testability and repair of hereditary hypergraph properties (Q3057063) (← links)
- On Sums of Locally Testable Affine Invariant Properties (Q3088113) (← links)
- Limits on the Rate of Locally Testable Affine-Invariant Codes (Q3088114) (← links)
- Public Key Locally Decodable Codes with Short Keys (Q3088130) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- The Complexity of Local List Decoding (Q3541812) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- (Q4836415) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Local Property Reconstruction and Monotonicity (Q4933387) (← links)
- High-entropy dual functions over finite fields and locally decodable codes (Q4965879) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- (Q5002633) (← links)
- Locality via Partially Lifted Codes (Q5002648) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Q5002790) (← links)
- Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5090407) (← links)
- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing (Q5098771) (← links)
- Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs (Q5112250) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Lower bounds for adaptive locally decodable codes (Q5704840) (← links)
