2021
DOI: 10.48550/arxiv.2110.02378
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

High-rate storage codes on triangle-free graphs

Abstract: Consider an assignment of bits to the vertices of a connected graph G(V, E) with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a storage code of length |V | on G. The storage code problem can be equivalently formulated as maximizing the probability of success in a guessing game on graphs, or constructing index codes of small rate.If G contains many cliques, it is easy to construct codes of rate close to 1, so a natural proble… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 27 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?