Hsuan-Yin Lin
Orcid: 0000-0001-8030-1919
According to our database1,
Hsuan-Yin Lin
authored at least 52 papers
between 2011 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, May, 2024
IEEE J. Sel. Areas Inf. Theory, 2024
Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel.
CoRR, 2024
Proceedings of the IEEE International Symposium on Information Theory, 2024
Proceedings of the IEEE International Symposium on Information Theory, 2024
2023
IEEE Trans. Inf. Theory, December, 2023
Proceedings of the IEEE Information Theory Workshop, 2023
Proceedings of the 12th International Symposium on Topics in Coding, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
IEEE Trans. Inf. Forensics Secur., 2022
IEEE Trans. Inf. Forensics Secur., 2022
IEEE J. Sel. Areas Commun., 2022
IEEE J. Sel. Areas Commun., 2022
CoRR, 2022
Proceedings of the IEEE International Symposium on Information Theory, 2022
2021
IEEE J. Sel. Areas Inf. Theory, 2021
CoRR, 2021
2020
Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks.
IEEE Trans. Signal Process., 2020
Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks.
IEEE/ACM Trans. Netw., 2020
2019
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes.
IEEE Trans. Inf. Theory, 2019
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper).
Proceedings of the 2019 IEEE Information Theory Workshop, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
IEEE Wirel. Commun. Lett., 2018
IEEE Trans. Inf. Theory, 2018
On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage.
CoRR, 2018
A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code.
CoRR, 2018
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage.
Proceedings of the IEEE Information Theory Workshop, 2018
Proceedings of the IEEE Information Theory Workshop, 2018
Proceedings of the International Symposium on Information Theory and Its Applications, 2018
An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018
Proceedings of the 56th Annual Allerton Conference on Communication, 2018
2017
Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code.
CoRR, 2017
2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2013
IEEE Trans. Inf. Theory, 2013
The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
Weak flip codes and applications to optimal code design on the binary erasure channel.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012
2011
Proceedings of the 2011 IEEE Information Theory Workshop, 2011