Kernels for storage capacity and dual index coding

The storage capacity of a graph measures the maximum amount of information that can be stored across its vertices, such that the information at any vertex can be recovered from the information stored at its neighborhood. The study of this graph quantity is motivated by applications in distributed st...

Full description

Bibliographic Details

Published in:	Journal of combinatorial theory. Series A Vol. 216; p. 106059
Main Author:	Haviv, Ishay
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2025
Subjects:	Index coding Kernelization Minrank Parameterized complexity Storage capacity Index coding Storage capacity Minrank Parameterized complexity Kernelization
ISSN:	0097-3165
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!