Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes

A functional k -batch code of dimension s consists of n servers storing linear combinations of s linearly independent information bits. Any multiset request of size k of linear combinations (or requests) of the information bits can be recovered by k disjoint subsets of the servers. The g...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 2022-10, Vol.68 (10), p.6434-6451
Hauptverfasser:	Yohananov, Lev, Yaakobi, Eitan
Format:	Artikel
Sprache:	eng
Schlagworte:	Batch codes Codes codes with availability Decoding Encoding Generators Information retrieval Linear codes Private Information Retrieval (PIR) Servers Simplex codes
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!