Batch codes and their applications

DOI10.1145/1007352.1007396zbMath1192.94100OpenAlexW2088336724WikidataQ56475325 ScholiaQ56475325MaRDI QIDQ3580973

Rafail Ostrovsky, Eyal Kushilevitz, Yuval Ishai, Amit Sahai

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007396

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Related Items (39)

The results on optimal values of some combinatorial batch codes ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Linear Batch Codes ⋮ Fractional Repetition and Erasure Batch Codes ⋮ Batch codes from affine Cartesian codes and quotient spaces ⋮ Batch Codes from Hamming and Reed-M\"uller Codes ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Locality via Partially Lifted Codes ⋮ Derandomized Construction of Combinatorial Batch Codes ⋮ Some optimal combinatorial batch codes with \(k=5\) ⋮ Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Streaming and unbalanced PSI from function secret sharing ⋮ Optimal single-server private information retrieval ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Optimal possibly nonlinear 3-PIR codes of small size ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ Random-index PIR and applications ⋮ On some batch code properties of the simplex code ⋮ Almost affinely disjoint subspaces ⋮ On the term rank partition ⋮ Unnamed Item ⋮ On erasure combinatorial batch codes ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks ⋮ Multiset combinatorial batch codes ⋮ Optimal combinatorial batch codes based on block designs ⋮ Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem ⋮ On an extremal hypergraph problem related to combinatorial batch codes ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ On the \(t\)-term rank of a matrix ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Lifted Multiplicity Codes and the Disjoint Repair Group Property ⋮ Efficient pseudorandom correlation generators from ring-LPN ⋮ Turán numbers and batch codes

This page was built for publication: Batch codes and their applications