Codes for erasures over directed graphs

Lev Yohananov, Eitan Yaakobi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


In this work we continue the study of a new class of codes, called codes over graphs. Here we consider storage systems where the information is stored on the edges of a complete directed graph with n nodes. The failure model we consider is of node failures which are erasures of all edges, both incoming and outgoing, connected to the failed node. It is said that a code over graphs is a ρ-node-erasure-correcting code if it can correct the failure of any ρ nodes in the graphs of the code. While the construction of such optimal codes is an easy task if the field size is O(n2), our main goal in the paper is the construction of codes over smaller fields. In particular, our main result is the construction of optimal binary codes over graphs which correct two node failures with a prime number of nodes.

Original languageEnglish
Title of host publication2017 IEEE Information Theory Workshop, ITW 2017
PublisherInstitute of Electrical and Electronics Engineers
Number of pages5
ISBN (Electronic)9781509030972
StatePublished - 2 Jul 2017
Externally publishedYes
Event2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China
Duration: 6 Nov 201710 Nov 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095


Conference2017 IEEE Information Theory Workshop, ITW 2017
Country/TerritoryTaiwan, Province of China

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Codes for erasures over directed graphs'. Together they form a unique fingerprint.

Cite this