7 papers · 1 filter
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…
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…
Double and Triple Node-Erasure-Correcting Codes over Graphs
Lev Yohananov, Yuval Efron, Eitan Yaakobi
In this paper we study array-based codes over graphs for correcting multiple node failures. These codes have applications to neural networks, associative memories, and distributed…
Codes for Erasures over Directed Graphs
Lev Yohananov, Eitan Yaakobi
In this work we continue the study of a new class of codes, called \emph{codes over graphs}. Here we consider storage systems where the information is stored on the edges of a comp…