Author:
Baumbaugh Travis Alan,Colgate Haley,Jackman Tim,Manganiello Felice
Publisher
Springer International Publishing
Reference19 articles.
1. Asi, H., Yaakobi, E.: Nearly optimal constructions of PIR and batch codes. IEEE Trans. Inf. Theory 65, 947–964 (2019)
2. Baumbaugh, T., Diaz, Y., Friesenhahn, S., Manganiello, F., Vetter, A.: Batch codes from Hamming and Reed-Muller codes. J. Algebra Comb. Discrete Struct. Appl. 5, 153–165 (2018)
3. Beelen, P., Datta, M.: Generalized Hamming weights of affine Cartesian codes. Finite Fields Appl. 51, 130–145 (2018)
4. Bhattacharya, S., Ruj, S., Roy, B.: Combinatorial batch codes: a lower bound and optimal constructions. Adv. Math. Commun. 6, 165–174 (2012)
5. Bujtás, C., Tuza, Z.: Optimal combinatorial batch codes derived from dual systems, Miskolc. Math. Notes 12, 11–23 (2011)