Private information retrieval from coded databases with colluding servers R Freij-Hollanti, OW Gnilke, C Hollanti, DA Karpuk SIAM Journal on Applied Algebra and Geometry 1 (1), 647-664, 2017 | 243 | 2017 |
GASP codes for secure distributed matrix multiplication RGL D’Oliveira, S El Rouayheb, D Karpuk IEEE Transactions on Information Theory 66 (7), 4038-4050, 2020 | 106 | 2020 |
Private information retrieval schemes for coded data with arbitrary collusion patterns R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti, ... 2017 IEEE International Symposium on Information Theory (ISIT), 1908-1912, 2017 | 100 | 2017 |
Private information retrieval from coded storage systems with colluding, Byzantine, and unresponsive servers R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti IEEE Transactions on information theory 65 (6), 3898-3906, 2019 | 90 | 2019 |
Private polynomial computation from Lagrange encoding N Raviv, DA Karpuk IEEE Transactions on Information Forensics and Security 15, 553-563, 2019 | 50 | 2019 |
Degree tables for secure distributed matrix multiplication RGL D’Oliveira, S El Rouayheb, D Heinlein, D Karpuk IEEE Journal on Selected Areas in Information Theory 2 (3), 907-918, 2021 | 35 | 2021 |
-private information retrieval schemes using transitive codes R Freij-Hollanti, OW Gnilke, C Hollanti, AL Horlemann-Trautmann, ... IEEE Transactions on Information Theory 65 (4), 2107-2118, 2018 | 35 | 2018 |
Notes on communication and computation in secure distributed matrix multiplication RGL D’Oliveira, S El Rouayheb, D Heinlein, D Karpuk 2020 IEEE Conference on Communications and Network Security (CNS), 1-6, 2020 | 28 | 2020 |
Private computation of systematically encoded data with colluding servers D Karpuk 2018 IEEE International Symposium on Information Theory (ISIT), 2112-2116, 2018 | 27 | 2018 |
Robust private information retrieval from coded systems with byzantine and colluding servers R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti 2018 IEEE International Symposium on Information Theory (ISIT), 2451-2455, 2018 | 22 | 2018 |
Towards practical private information retrieval from MDS array codes J Li, D Karpuk, C Hollanti IEEE Transactions on Communications 68 (6), 3415-3425, 2020 | 16 | 2020 |
Well-rounded lattices: Towards optimal coset codes for Gaussian and fading wiretap channels MT Damir, A Karrila, L Amoros, OW Gnilke, D Karpuk, C Hollanti IEEE Transactions on Information Theory 67 (6), 3645-3663, 2021 | 15 | 2021 |
Probability estimates for fading and wiretap channels from ideal class zeta functions D Karpuk, AM Ernvall-Hytönen, C Hollanti, E Viterbo arXiv preprint arXiv:1412.6946, 2014 | 15* | 2014 |
Perfect secrecy in physical-layer network coding systems from structured interference DA Karpuk, A Chorti IEEE Transactions on Information Forensics and Security 11 (8), 1875-1887, 2016 | 13 | 2016 |
Space-time storage codes for wireless distributed storage systems C Hollanti, D Karpuk, A Barreal, HF Lu 2014 4th International Conference on Wireless Communications, Vehicular …, 2014 | 13 | 2014 |
Well-rounded lattices for coset coding in MIMO wiretap channels OW Gnilke, A Barreal, A Karrila, HTN Tran, DA Karpuk, C Hollanti 2016 26th International Telecommunication Networks and Applications …, 2016 | 12 | 2016 |
Cohomology of the Weil group of a p-adic field DA Karpuk Journal of Number Theory 133 (4), 1270-1288, 2013 | 11* | 2013 |
Channel pre-inversion and max-SINR vector perturbation for large-scale broadcast channels DA Karpuk, P Moss IEEE Transactions on Broadcasting 63 (3), 494-506, 2017 | 9 | 2017 |
Locally diverse constellations from the special orthogonal group DA Karpuk, C Hollanti IEEE Transactions on Wireless Communications 15 (6), 4426-4437, 2016 | 8 | 2016 |
Well-rounded twists of ideal lattices from real quadratic fields MT Damir, D Karpuk Journal of Number Theory 196, 168-196, 2019 | 7 | 2019 |