| Achieving maximum distance separable private information retrieval capacity with linear codes S Kumar, HY Lin, E Rosnes, AG i Amat IEEE Transactions on Information Theory 65 (7), 4243-4273, 2019 | 109* | 2019 |
| Optimal joint routing and scheduling in millimeter-wave cellular networks D Yuan, HY Lin, J Widmer, M Hollick IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 1205-1213, 2018 | 64 | 2018 |
| Optimal ultrasmall block-codes for binary discrete memoryless channels PN Chen, HY Lin, SM Moser IEEE Transactions on Information Theory 59 (11), 7346-7378, 2013 | 36 | 2013 |
| An MDS-PIR capacity-achieving protocol for distributed storage using non-MDS linear codes HY Lin, S Kumar, E Rosnes, AG i Amat 2018 IEEE International Symposium on Information Theory (ISIT), 966-970, 2018 | 32* | 2018 |
| Capacity of private linear computation for coded databases SA Obead, HY Lin, E Rosnes, J Kliewer 2018 56th Annual Allerton Conference on Communication, Control, and …, 2018 | 29 | 2018 |
| Weakly-Private Information Retrieval HY Lin, S Kumar, E Rosnes, A Graell i Amat, E Yaakobi arXiv:1901.06730 [cs.IT], 2019 | 28 | 2019 |
| Error probability analysis of binary asymmetric channels SM Moser, PN Chen, HY Lin Dept. El. & Comp. Eng., Nat. Chiao Tung Univ, 2009 | 24 | 2009 |
| Multi-server weakly-private information retrieval HY Lin, S Kumar, E Rosnes, AG i Amat, E Yaakobi IEEE Transactions on Information Theory, 2021 | 23 | 2021 |
| The capacity of single-server weakly-private information retrieval HY Lin, S Kumar, E Rosnes, AG i Amat, E Yaakobi IEEE Journal on Selected Areas in Information Theory 2 (1), 415-427, 2021 | 23 | 2021 |
| Asymmetry helps: Improved private information retrieval protocols for distributed storage HY Lin, S Kumar, E Rosnes, AG i Amat 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 18 | 2018 |
| Optimal and approximation algorithms for joint routing and scheduling in millimeter-wave cellular networks D Yuan, HY Lin, J Widmer, M Hollick IEEE/ACM Transactions on Networking 28 (5), 2188-2202, 2020 | 17 | 2020 |
| Weak flip codes and their optimality on the binary erasure channel HY Lin, SM Moser, PN Chen IEEE Transactions on Information Theory 64 (7), 5191-5218, 2018 | 17 | 2018 |
| Lengthening and extending binary private information retrieval codes HY Lin, E Rosnes arXiv preprint arXiv:1707.03495, 2017 | 16 | 2017 |
| On the fundamental limit of private information retrieval for coded distributed storage HY Lin, S Kumar, E Rosnes arXiv preprint arXiv:1808.09018, 2018 | 12 | 2018 |
| Weak flip codes and applications to optimal code design on the binary erasure channel PN Chen, HY Lin, SM Moser 2012 50th Annual Allerton Conference on Communication, Control, and …, 2012 | 12 | 2012 |
| Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks HY Lin, PN Chen, YS Han, PK Varshney IEEE Transactions on Signal Processing 68, 647-661, 2020 | 11 | 2020 |
| Private polynomial computation for noncolluding coded databases SA Obead, HY Lin, E Rosnes, J Kliewer 2019 IEEE International Symposium on Information Theory (ISIT), 1677-1681, 2019 | 11 | 2019 |
| Equidistant codes meeting the Plotkin bound are not optimal on the binary symmetric channel PN Chen, HY Lin, SM Moser 2013 IEEE International Symposium on Information Theory, 3015-3019, 2013 | 11 | 2013 |
| Optimal rate-distortion-leakage tradeoff for single-server information retrieval Y Yakimenka, HY Lin, E Rosnes, J Kliewer IEEE Journal on Selected Areas in Communications 40 (3), 832-846, 2022 | 10 | 2022 |
| On the capacity of private monomial computation Y Yakimenka, HY Lin, E Rosnes arXiv preprint arXiv:2001.06320, 2020 | 8 | 2020 |
Eirik RosnesSection Leader, Simula UiB在 simula.no 的电子邮件经过验证
