( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Capacity of Single-Server Weakly-Private Information Retrieval.

, , , , и . ISIT, стр. 1053-1058. IEEE, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lin Yin

Shang-Hsuan Lin

Yin-Hung Lin

Yin-Lin Wang

Yin-Hsia Lin

 

Другие публикации лиц с тем же именем

The r-wise hamming distance and its operational interpretation for block codes., , и . CISS, стр. 1-6. IEEE, (2018)On the Capacity of Private Monomial Computation., , и . CoRR, (2020)Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper)., , , и . ITW, стр. 1-5. IEEE, (2019)Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel., , и . ISIT, стр. 3015-3019. IEEE, (2013)Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes., , , и . IEEE Trans. Inf. Theory, 65 (7): 4243-4273 (2019)Weak Flip Codes and their Optimality on the Binary Erasure Channel., , и . IEEE Trans. Inf. Theory, 64 (7): 5191-5218 (2018)Formally Unimodular Packings for the Gaussian Wiretap Channel., , и . IEEE Trans. Inf. Theory, 69 (12): 7755-7776 (декабря 2023)Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4., , и . CoRR, (2023)Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval., , , , и . CoRR, (2020)Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval., , , и . ISIT, стр. 2262-2267. IEEE, (2021)