Sergey Yekhanin

Available identifiers

zbMath Open yekhanin.sergeyMaRDI QIDQ301518

List of research outcomes

Publication	Date of Publication	Type
Batch Optimization for DNA Synthesis	2024-03-14	Paper
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities	2020-12-04	Paper
Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities	2019-10-15	Paper
Maximally Recoverable Codes for Grid-like Topologies	2018-07-16	Paper
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity	2018-01-24	Paper
Codes with local decoding procedures	2017-11-06	Paper
On the Locality of Codeword Symbols	2017-06-08	Paper
Explicit Maximally Recoverable Codes With Locality	2017-05-16	Paper
Kolmogorov width of discrete linear spaces: an approach to matrix rigidity	2016-06-30	Paper
Book review of: S. Jukna, Boolean function complexity. Advances and frontiers.	2016-05-20	Paper
High-rate codes with sublinear-time decoding	2015-08-14	Paper
High-rate codes with sublinear-time decoding	2014-06-05	Paper
On the locality of codeword symbols in non-linear codes	2014-03-20	Paper
Locally decodable codes	2014-01-15	Paper
A note on the Newton radius	2012-08-10	Paper
Matching vector codes	2011-11-07	Paper
Locally Decodable Codes	2011-06-17	Paper
Locally decodable codes: a brief survey	2011-06-08	Paper
An \(\Omega (n^{1/3})\) lower bound for bilinear group based private information retrieval	2011-05-24	Paper
Sets with large additive energy and symmetric sets	2011-04-11	Paper
The complexity of matrix completion	2010-08-16	Paper
Locally decodable codes and private information retrieval schemes.	2010-08-03	Paper
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers	2009-11-06	Paper
Deterministic Approximation Algorithms for the Nearest Codeword Problem	2009-10-28	Paper
New Efficient Attacks on Statistical Disclosure Control Mechanisms	2009-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3549622	2009-01-05	Paper
Towards 3-query locally decodable codes of subexponential length	2008-12-21	Paper
Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance	2008-12-21	Paper
Improved Upper Bound for the Redundancy of Fix-Free Codes	2008-12-21	Paper
A note on plane pointless curves	2008-09-25	Paper
A Geometric Approach to Information-Theoretic Private Information Retrieval	2008-08-14	Paper
On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests	2006-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4664666	2005-04-08	Paper
https://portal.mardi4nfdi.de/entity/Q4664667	2005-04-08	Paper
Trivial two-stage group testing for complexes using almost disjunct matrices.	2004-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q4501023	2000-09-03	Paper

Research outcomes over time

This page was built for person: Sergey Yekhanin