Pages that link to "Item:Q3580973"

The following pages link to Batch codes and their applications (Q3580973):

Displaying 38 items.

• On an extremal hypergraph problem related to combinatorial batch codes (Q741768) (← links)
• On the \(t\)-term rank of a matrix (Q765173) (← links)
• The results on optimal values of some combinatorial batch codes (Q1620968) (← links)
• On erasure combinatorial batch codes (Q1783704) (← links)
• Architecture-aware coding for distributed storage: repairable block failure resilient codes (Q1784988) (← links)
• Multiset combinatorial batch codes (Q1791675) (← links)
• Almost affinely disjoint subspaces (Q1979948) (← links)
• Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
• Private information retrieval with sublinear online time (Q2055601) (← links)
• An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
• Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
• Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
• Batch codes from affine Cartesian codes and quotient spaces (Q2149781) (← links)
• Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
• Two classes of optimal LRCs with information \((r, t)\)-locality (Q2200511) (← links)
• On the term rank partition (Q2250922) (← links)
• Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks (Q2282786) (← links)
• Turán numbers and batch codes (Q2345596) (← links)
• Some optimal combinatorial batch codes with \(k=5\) (Q2416426) (← links)
• Erasure combinatorial batch codes based on nonadaptive group testing (Q2420475) (← links)
• Random-index PIR and applications (Q2697885) (← links)
• On some batch code properties of the simplex code (Q2701478) (← links)
• Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
• Combinatorial batch codes: extremal problems under Hall-type conditions (Q2857344) (← links)
• Derandomized Construction of Combinatorial Batch Codes (Q2947886) (← links)
• Linear Batch Codes (Q3460471) (← links)
• Fractional Repetition and Erasure Batch Codes (Q3460483) (← links)
• Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
• Locality via Partially Lifted Codes (Q5002648) (← links)
• Batch Codes from Hamming and Reed-M\"uller Codes (Q5241179) (← links)
• Lifted Multiplicity Codes and the Disjoint Repair Group Property (Q5875494) (← links)
• Optimal combinatorial batch codes based on block designs (Q5963364) (← links)
• Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
• Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
• Streaming and unbalanced PSI from function secret sharing (Q6134846) (← links)
• Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces (Q6570056) (← links)
• Anonymous permutation routing (Q6582210) (← links)
• The service rate region polytope (Q6594417) (← links)