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:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4.
IEEE Trans. Inf. Theory, May, 2024

Straggler-Resilient Differentially Private Decentralized Learning.
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

On the Maximum Theta Series over Unimodular Lattices.
CoRR, 2024

Weakly-Private Information Retrieval From MDS-Coded Distributed Storage.
CoRR, 2024

Improved Capacity Outer Bound for Private Quadratic Monomial Computation.
CoRR, 2024

Generalizing Quantum Tanner Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Age Aware Scheduling for Differentially-Private Federated Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Formally Unimodular Packings for the Gaussian Wiretap Channel.
IEEE Trans. Inf. Theory, December, 2023

Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions.
Proceedings of the IEEE Information Theory Workshop, 2023

On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Differentially-Private Collaborative Online Personalized Mean Estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Single-Server Pliable Private Information Retrieval With Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Efficient Interpolation-Based Decoding of Reed-Solomon Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Multi-Server Weakly-Private Information Retrieval.
IEEE Trans. Inf. Theory, 2022

Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval.
IEEE Trans. Inf. Forensics Secur., 2022

Private Polynomial Function Computation for Noncolluding Coded Databases.
IEEE Trans. Inf. Forensics Secur., 2022

Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval.
IEEE J. Sel. Areas Commun., 2022

Private Linear Computation for Noncolluding Coded Databases.
IEEE J. Sel. Areas Commun., 2022

On the Secrecy Gain of Formally Unimodular Construction A<sub>4</sub> Lattices.
CoRR, 2022

On the Secrecy Gain of Formally Unimodular Construction A4 Lattices.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
The Capacity of Single-Server Weakly-Private Information Retrieval.
IEEE J. Sel. Areas Inf. Theory, 2021

The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel.
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

Private Function Computation for Noncolluding Coded Databases.
CoRR, 2020

On the Capacity of Private Monomial Computation.
CoRR, 2020

2019
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes.
IEEE Trans. Inf. Theory, 2019

On the Capacity of Private Nonlinear Computation for Replicated Databases.
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

Private Polynomial Computation for Noncolluding Coded Databases.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Weakly-Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Target Localization Using Sensor Location Knowledge in Wireless Sensor Networks.
IEEE Wirel. Commun. Lett., 2018

Weak Flip Codes and their Optimality on the Binary Erasure Channel.
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

Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes.
Proceedings of the IEEE Information Theory Workshop, 2018

Connections Between the Error Probability and the r-wise Hamming Distances.
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

Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

The r-wise hamming distance and its operational interpretation for block codes.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

Capacity of Private Linear Computation for Coded Databases.
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

Lengthening and Extending Binary Private Information Retrieval Codes.
CoRR, 2017

2016
Optimal Byzantine attack for distributed inference with M-ary quantized data.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Nonlinear codes outperform the best linear codes on the binary erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2013
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels.
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
Ultra-small block-codes for binary discrete memoryless channels.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011


  Loading...