3 citations · 3 across the 6 of their papers we have counts for
9 papers
Optimal Functional -Batch Codes: Exploring New Sufficient Conditions
Lev Yohananov, Isaac Barouch Essayag
A functional -batch code of dimension consists of servers storing linear combinations of linearly independent information bits. These codes are designed to recover a…
The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
Lev Yohananov, Moshe Schwartz
We completely determine the second covering radius for binary primitive double-error-correcting BCH codes. As part of this process, we provide a lower bound on the second covering…
On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes
Lev Yohananov, Moshe Schwartz
We derive the coding capacity for duplication-correcting codes capable of correcting any number of duplications. We do so both for reverse-complement duplications, as well as palin…
Storage codes on coset graphs with asymptotically unit rate
Alexander Barg, Moshe Schwartz, Lev Yohananov
A storage code on a graph is a set of assignments of symbols to the vertices such that every vertex can recover its value by looking at its neighbors. We consider the question…
Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes
Lev Yohananov, Eitan Yaakobi
A \textit{functional -batch} code of dimension consists of servers storing linear combinations of linearly independent information bits. Any multiset request of size…
Codes over Trees
Lev Yohananov, Eitan yaakobi
In graph theory, a tree is one of the more popular families of graphs with a wide range of applications in computer science as well as many other related fields. While there are se…