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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial theory. Series A Ročník 216; s. 106059
Hlavný autor:	Haviv, Ishay
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.11.2025
Predmet:	Index coding Kernelization Minrank Parameterized complexity Storage capacity Index coding Storage capacity Minrank Parameterized complexity Kernelization
ISSN:	0097-3165
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!