The following pages link to Sergey Yekhanin (Q301518):
Displaying 36 items.
- Kolmogorov width of discrete linear spaces: an approach to matrix rigidity (Q301519) (← links)
- A note on the Newton radius (Q442332) (← links)
- A note on plane pointless curves (Q946895) (← links)
- Locally decodable codes and private information retrieval schemes. (Q983163) (← links)
- Trivial two-stage group testing for complexes using almost disjunct matrices. (Q1422408) (← links)
- Sets with large additive energy and symmetric sets (Q2431268) (← links)
- On the locality of codeword symbols in non-linear codes (Q2440947) (← links)
- Explicit Maximally Recoverable Codes With Locality (Q2986142) (← links)
- On the Locality of Codeword Symbols (Q2989710) (← links)
- (Q3002789) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Matching Vector Codes (Q3096097) (← links)
- On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests (Q3375540) (← links)
- A Geometric Approach to Information-Theoretic Private Information Retrieval (Q3519387) (← links)
- Towards 3-query locally decodable codes of subexponential length (Q3546358) (← links)
- Improved Upper Bound for the Redundancy of Fix-Free Codes (Q3547853) (← links)
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance (Q3547854) (← links)
- (Q3549622) (← links)
- The complexity of matrix completion (Q3581565) (← links)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms (Q3600235) (← links)
- Deterministic Approximation Algorithms for the Nearest Codeword Problem (Q3638889) (← links)
- Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers (Q3642869) (← links)
- (Q4501023) (← links)
- Maximally Recoverable Codes for Grid-like Topologies (Q4575884) (← links)
- (Q4589024) (← links)
- (Q4601836) (← links)
- (Q4664666) (← links)
- (Q4664667) (← links)
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities (Q5138793) (← links)
- Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities (Q5236317) (← links)
- High-rate codes with sublinear-time decoding (Q5419086) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Book Reviews (Q5890688) (← links)
- Locally Decodable Codes (Q5891400) (← links)
- Locally Decodable Codes (Q5892557) (← links)
- Batch Optimization for DNA Synthesis (Q6195780) (← links)
