Follow
Hsuan-Yin Lin
Title
Cited by
Cited by
Year
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
85*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
492018
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
312013
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
29*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
242018
Error probability analysis of binary asymmetric channels
SM Moser, PN Chen, HY Lin
Dept. El. & Comp. Eng., Nat. Chiao Tung Univ, 2009
212009
Weakly-Private Information Retrieval
HY Lin, S Kumar, E Rosnes, A Graell i Amat, E Yaakobi
arXiv:1901.06730 [cs.IT], 2019
192019
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
152018
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
142018
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
122012
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
112021
On the fundamental limit of private information retrieval for coded distributed storage
HY Lin, S Kumar, E Rosnes
arXiv preprint arXiv:1808.09018, 2018
112018
Lengthening and extending binary private information retrieval codes
HY Lin, E Rosnes
arXiv preprint arXiv:1707.03495, 2017
112017
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
102019
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
92020
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
92013
Ultra-small block-codes for binary discrete memoryless channels
PN Chen, HY Lin, SM Moser
2011 IEEE Information Theory Workshop, 175-179, 2011
82011
Multi-server weakly-private information retrieval
HY Lin, S Kumar, E Rosnes, AG i Amat, E Yaakobi
IEEE Transactions on Information Theory, 2021
72021
Private function computation for noncolluding coded databases
SA Obead, HY Lin, E Rosnes, J Kliewer
arXiv preprint arXiv:2003.10007, 2020
62020
On the capacity of private monomial computation
Y Yakimenka, HY Lin, E Rosnes
arXiv preprint arXiv:2001.06320, 2020
62020
The system can't perform the operation now. Try again later.
Articles 1–20