Batch codes and their applications
From MaRDI portal
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
Cited in
(51)- The results on optimal values of some combinatorial batch codes
- On erasure combinatorial batch codes
- Architecture-aware coding for distributed storage: repairable block failure resilient codes
- Multiset combinatorial batch codes
- Almost affinely disjoint subspaces
- Verifiable single-server private information retrieval from LWE with binary errors
- Private information retrieval with sublinear online time
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Efficient pseudorandom correlation generators from ring-LPN
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Batch codes from affine Cartesian codes and quotient spaces
- Single-server private information retrieval with sublinear amortized time
- Two classes of optimal LRCs with information (r, t)-locality
- On the term rank partition
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Turán numbers and batch codes
- Some optimal combinatorial batch codes with k=5
- Erasure combinatorial batch codes based on nonadaptive group testing
- Random-index PIR and applications
- On some batch code properties of the simplex code
- Private information retrieval with preprocessing based on the approximate GCD problem
- Combinatorial batch codes: extremal problems under Hall-type conditions
- Derandomized construction of combinatorial batch codes
- Linear batch codes
- Fractional repetition and erasure batch codes
- Another Look at Extended Private Information Retrieval Protocols
- Locality via partially lifted codes
- Batch codes from Hamming and Reed-Muller codes
- Lifted Multiplicity Codes and the Disjoint Repair Group Property
- Optimal combinatorial batch codes based on block designs
- Almost affinely disjoint subspaces and covering Grassmannian codes
- 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
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- Anonymous permutation routing
- The service rate region polytope
- Malicious security for PIR (almost) for free
- Information-theoretic single-server PIR in the shuffle model
- Linear-size Boolean circuits for multiselection
- Single-server client preprocessing PIR with tight space-time trade-off
- Information-theoretic multi-server private information retrieval with client preprocessing
- Towards practical doubly-efficient private information retrieval
- On generalized combinatorial batch codes
- Two-server private information retrieval in sublinear time and quasilinear space
- Structured-seed local pseudorandom generators and their applications
- On an extremal hypergraph problem related to combinatorial batch codes
- On the \(t\)-term rank of a matrix
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)
