Pages that link to "Item:Q5963364"
From MaRDI portal
The following pages link to Optimal combinatorial batch codes based on block designs (Q5963364):
Displaying 20 items.
- Combinatorial batch codes: a lower bound and optimal constructions (Q444518) (← links)
- Combinatorial batch codes and transversal matroids (Q540388) (← links)
- Optimal batch codes: many items or low retrieval requirement (Q644328) (← links)
- Optimization models for complex recovery block schemes (Q1302743) (← links)
- The results on optimal values of some combinatorial batch codes (Q1620968) (← links)
- Constructions and bounds for batch codes with small parameters (Q1705537) (← links)
- Multiset combinatorial batch codes (Q1791675) (← links)
- Batch codes from affine Cartesian codes and quotient spaces (Q2149781) (← links)
- Access balancing in storage systems by labeling partial Steiner systems (Q2205889) (← links)
- Combinatorial batch codes (Q2268236) (← links)
- Some optimal combinatorial batch codes with \(k=5\) (Q2416426) (← links)
- Erasure combinatorial batch codes based on nonadaptive group testing (Q2420475) (← links)
- 基于RTD(q-2,q)的一类组合批处理码 (Q2983585) (← links)
- A Class of Combinatorial Batch Code Based on the ${ p}$ Construction (Q3131051) (← links)
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage (Q3174717) (← links)
- Linear Batch Codes (Q3460471) (← links)
- Batch Codes from Hamming and Reed-M\"uller Codes (Q5241179) (← links)
- On the maximum double independence number of Steiner triple systems (Q6146768) (← links)
- Design of extended dense coding protocol strategy based on combinatorial optimization (Q6166201) (← links)
- Resolutions for an infinite family of Bose triple systems (Q6616801) (← links)