Batch Codes Through Dense Graphs Without Short Cycles

DOI10.1109/TIT.2016.2524007zbMath1359.94814arXiv1410.2920MaRDI QIDQ2976882

Zhao Song, Alexandros G. Dimakis, Anna Gál, A. S. Rawat

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.2920

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cyclic codes (94B15) Combinatorial codes (94B25)

Related Items (3)

Locality via Partially Lifted Codes ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Lifted Multiplicity Codes and the Disjoint Repair Group Property

This page was built for publication: Batch Codes Through Dense Graphs Without Short Cycles