Batch codes and their applications
DOI10.1145/1007352.1007396zbMATH Open1192.94100DBLPconf/stoc/IshaiKOS04OpenAlexW2088336724WikidataQ56475325 ScholiaQ56475325MaRDI QIDQ3580973FDOQ3580973
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
Recommendations
- Combinatorial batch codes
- Linear batch codes
- Multiset combinatorial batch codes
- A special kind of combinatorial batch codes
- Batch codes from Hamming and Reed-Muller codes
- Array Codes for Functional PIR and Batch Codes
- Binary Batch Codes With Improved Redundancy
- Turán numbers and batch codes
- Batch Codes for Asynchronous Recovery of Data
- Optimal batch codes: many items or low retrieval requirement
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)
Cited In (42)
- Batch Codes from Hamming and Reed-M\"uller Codes
- Lower bounds for (batch) PIR with private preprocessing
- Optimal single-server private information retrieval
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Batch codes from affine Cartesian codes and quotient spaces
- Linear Batch Codes
- Another Look at Extended Private Information Retrieval Protocols
- Cuckoo hashing in cryptography: optimal parameters, robustness and applications
- Anonymous permutation routing
- The results on optimal values of some combinatorial batch codes
- On the term rank partition
- Optimal combinatorial batch codes based on block designs
- The service rate region polytope
- Optimal possibly nonlinear 3-PIR codes of small size
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Locality via Partially Lifted Codes
- On an extremal hypergraph problem related to combinatorial batch codes
- Turán numbers and batch codes
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Multiset combinatorial batch codes
- Derandomized Construction of Combinatorial Batch Codes
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Single-server private information retrieval with sublinear amortized time
- On the \(t\)-term rank of a matrix
- Private information retrieval with sublinear online time
- Verifiable single-server private information retrieval from LWE with binary errors
- Efficient pseudorandom correlation generators from ring-LPN
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem
- Some optimal combinatorial batch codes with \(k=5\)
- Fractional Repetition and Erasure Batch Codes
- On erasure combinatorial batch codes
- Random-index PIR and applications
- On some batch code properties of the simplex code
- Erasure combinatorial batch codes based on nonadaptive group testing
- Streaming and unbalanced PSI from function secret sharing
- Two classes of optimal LRCs with information \((r, t)\)-locality
- Almost affinely disjoint subspaces
- Combinatorial batch codes: extremal problems under Hall-type conditions
- An asymptotically optimal construction of almost affinely disjoint subspaces
This page was built for publication: Batch codes and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580973)
