David Karpuk

Constructing Partial MDS Codes from Reducible Curves

2020 · arXiv (Cornell University)

We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such …

Private Information Retrieval from Coded Storage Systems with Colluding,\n Byzantine, and Unresponsive Servers

2018 · arXiv (Cornell University)

The problem of Private Information Retrieval (PIR) from coded storage systems\nwith colluding, byzantine, and unresponsive servers is considered. An explicit\nscheme using an $[n,k]$ Reed-Solomon storage code is designed, protecting\nagainst $t$-collusion and handling up to $b$ …