Publications

The declaration of the copyright is at the bottom of this page. Please, don't hesitate to contact me at hsuan-yin.lin@ieee.org if you have any questions or if you need more information.
 
In collaboration with Prof. Dr. Stefan M. Moser and Prof. Dr. Po-Ning Chen, a number of my publications have the alphabetical order of authors.

Contents


Preprints and Submitted Manuscripts

 
Olai Å. Mostad, Eirik Rosnes, and Hsuan-Yin Lin:
Asymptotically Good Generalized Quantum Tanner Codes, submitted, Nov. 22, 2024. (Abstract
)
 
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation, submitted, Nov. 11, 2024. (Abstract
) [arXiv:2411.07094]
 
Hsuan-Yin Lin, Yi-Sheng Su, and Mao-Ching Chiu:
Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel, Sep. 1, 2024. (Abstract
) [arXiv:2409.00852]
 
Maiara F. Bollauf and Hsuan-Yin Lin:
On the Maximum Theta Series over Unimodular Lattices, Apr. 5, 2024. (Abstract
) [arXiv:2403.16932]
 
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Private Function Computation for Noncolluding Coded Databases, Aug. 4, 2021. (Abstract
) [arXiv:2003.10007]
 
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage, Aug. 27, 2018. (Abstract
) [arXiv:1808.09018]

Journal Papers

2024
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning, IEEE Journal on Selected Areas in Information Theory, vol. 5, pp. 407–423, May, 2024. (Abstract
) [arXiv:2212.03080] [IEEE Xplore]
 
Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4, IEEE Transactions on Information Theory, vol. 70, no. 5, pp. 3309–3329, May  2024. (Abstract
) [arXiv:2303.08083] [IEEE Xplore]
2023
Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel, IEEE Transactions on Information Theory, vol. 69, no. 12, pp. 7755–7776, Dec.  2023. (Abstract
) [arXiv:2206.14171] [IEEE Xplore]
2022
Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval, IEEE Transactions on Information Forensics and Security, vol. 17, pp. 3495–3510, 2022. (Abstract
) [arXiv:2012.03902] [IEEE Xplore]
 
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Private Polynomial Function Computation for Noncolluding Coded Databases, IEEE Transactions on Information Forensics and Security, vol. 17, pp. 1800–1813, 2022. (Abstract
) [e-print] [IEEE Xplore]
 
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Private Linear Computation for Noncolluding Coded Databases, IEEE Journal on Selected Areas in Communications, no. 3, pp. 847–861, Mar. 2022. (Abstract
) [e-print] [IEEE Xplore]
 
Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval, IEEE Journal on Selected Areas in Communications, vol. 40, no. 3, pp. 832–846, Mar. 2022. (Abstract
) [arXiv:2111.05160] [IEEE Xplore]
 
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Multi-Server Weakly-Private Information Retrieval, IEEE Transactions on Information Theory, vol. 68, no. 2, pp. 1197–1219, Feb. 2022. (Abstract
) [arXiv:2007.10174] [IEEE Xplore]
 
2021
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval, IEEE Journal on Selected Areas in Information Theory, vol. 2, no. 1, pp. 415–427, Mar. 2021. (Abstract
) [arXiv:2001.08727] [IEEE Xplore]
 
2020
Dingwen Yuan, Hsuan-Yin Lin, Joerg Widmer, Matthias Hollick:
Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks, IEEE/ACM Transactions on Networking, vol. 28, no. 5, pp. 2188–2202, Oct. 2020. (Abstract
) [arXiv:2007.02621] [IEEE Xplore]
 
Hsuan-Yin Lin, Po-Ning Chen, Yunghsiang S. Han, Pramod K. Varshney:
Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks, IEEE Transactions on Signal Processing, vol. 68, pp. 647–661, Jan. 2020. (Abstract
) [e-print] [IEEE Xplore]
 
2019
Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes, IEEE Transactions on Information Theory, vol. 65, no. 7, pp. 4243–4273, Jul. 2019. (Abstract
) [arXiv:1712.03898] [IEEE Xplore]
 
2018
Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Weak Flip Codes and their Optimality on the Binary Erasure Channel, IEEE Transactions on Information Theory, vol. 64, no. 7, pp. 5191–5218, Jul. 2018. (Abstract
) [e-print] [correction] [arXiv:1711.03310] [IEEE Xplore]
 
Chun-Yi Wei, Hsuan-Yin Lin, Po-Ning Chen, Yunghsiang S. Han, Pramod K. Varshney:
Target Localization Using Sensor Location Knowledge in Wireless Sensor Networks, IEEE Wireless Communications Letters, vol. 7, no. 3, pp. 456–459, Jun. 2018. (Abstract
) [e-print] [IEEE Xplore]
 
2013
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels, IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7346–7378, Nov. 2013. (Abstract
) [e-print] [IEEE Xplore]

Conference Papers

2024
Olai Å. Mostad, Eirik Rosnes, and Hsuan-Yin Lin:
Generalizing Quantum Tanner Codes, in Proceedings 2024 IEEE International Symposium on Information Theory Workshops (ISIT-W), Athens, Greece, Jul. 7, 2024. (Abstract
) [arXiv:2405.07980] [IEEE Xplore]
Kuan-Yu Lin, Hsuan-Yin Lin, Yu-Pin Hsu, and Yu-Chih Huang:
Age Aware Scheduling for Differentially-Private Federated Learning, in Proceedings 2024 IEEE International Symposium on Information Theory (ISIT'24), Athens, Greece, Jul. 7–12, 2024, pp. 398–403. (Abstract
) [arXiv:2405.05962] [IEEE Xplore]
Asbjørn O. Orvedal, Hsuan-Yin Lin, and Eirik Rosnes:
Weakly-Private Information Retrieval From MDS-Coded Distributed Storage, in Preceedings 2024 International Zurich Seminar on Information and Communication (IZS'24), Zurich, Switzerland, Mar. 6–8, 2024, pp. 40–44. (Abstract
) [ETH Library] [arXiv:2401.09412]
Karen M. Dæhli, Sarah A. Obead, Hsuan-Yin Lin, and Eirik Rosnes:
Improved Capacity Outer Bound for Private Quadratic Monomial Computation, in Preceedings 2024 International Zurich Seminar on Information and Communication (IZS'24), Zurich, Switzerland, Mar. 6–8, 2024, pp. 35–39. (Abstract
) [ETH Library] [arXiv:2401.06125]
2023
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation, Poster session at Asilomar Conference on Signals, Systems, and Computers (Invited), Pacific Grove, CA, USA, Oct. 29–Nov. 1, 2023. [poster]
Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes, in Preceedings 2023 International Symposium on Topics in Coding (ISTC'23), Brest, France, Sep. 4–8, 2023, pp. 206–210. (Abstract
) [e-print] [poster] [IEEE Xplore]
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation, in Proceedings 2023 IEEE International Symposium on Information Theory (ISIT'23), Taipei, Taiwan, Jun. 25–30, 2023, pp. 737–742. (Abstract
) [e-print] [IEEE Xplore]
Sarah A. Obead, Hsuan-Yin Lin, and Eirik Rosnes:
Single-Server Pliable Private Information Retrieval with Side Information, in Proceedings 2023 IEEE International Symposium on Information Theory (ISIT'23), Taipei, Taiwan, Jun. 25–30, 2023, pp. 1526–1531. (Abstract
) [arXiv:2305.06857] [IEEE Xplore]
Wrya K. Kadir, Hsuan-Yin Lin, and Eirik Rosnes:
Efficient Interpolation-Based Decoding of Reed-Solomon Codes, in Proceedings 2023 IEEE International Symposium on Information Theory (ISIT'23), Taipei, Taiwan, Jun. 25–30, 2023, pp. 997–1002. (Abstract
) [arXiv:2307.00891] [IEEE Xplore]
Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions, in Proceedings 2023 IEEE Information Theory Workshop (ITW'23), Saint-Malo, France, Apr. 23–28, 2023, pp. 186–191. (Abstract
) [e-print] [IEEE Xplore]
 
2022
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning, in Proceedings 2022 IEEE Information Theory Workshop (ITW'22), Mumbai, India, Nov. 6–9, 2022, pp. 708–713. (Abstract
) [e-print] [IEEE Xplore]
Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction \(\text{A}_4\) Lattices, in Proceedings 2022 IEEE International Symposium on Information Theory (ISIT'22), Espoo, Finland, Jun. 26–Jul. 1, 2022, pp. 3239–3244. (Abstract
) [arXiv:2202.09236] [IEEE Xplore]
Maiara F. Bollauf, Hsuan-Yin Lin, and Øyvind Ytrehus:
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel, in Proceedings 2022 International Zurich Seminar on Information and Communication (IZS'22), Zurich, Switzerland, Mar. 2–4, 2022, pp. 69–73. (Abstract
) [e-print] [arXiv:2111.01439]
2021
Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval, in Proceedings 2021 IEEE International Symposium on Information Theory (ISIT'21), Melbourne, Australia, Jul. 12–20, 2021, pp. 2262–2267. (Abstract
) [e-print] [IEEE Xplore]
2020
Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval, Poster session at 2020 NeurIPS Workshop on Privacy Preserving Machine Learning, Dec. 11, 2020. (Abstract
) [poster]
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval, in Proceedings 2020 IEEE International Symposium on Information Theory (ISIT'20), Los Angeles, CA, USA, Jun. 21–26, 2020, pp. 1053–1058. (Abstract
) [e-print] [IEEE Xplore]
Yauhen Yakimenka, Hsuan-Yin Lin, and Eirik Rosnes:
On the Capacity of Private Monomial Computation, in Proceedings 2020 International Zurich Seminar on Information and Communication (IZS'20), Zurich, Switzerland, Feb. 26–28, 2020, pp. 31–35. (Abstract
) [e-print] [arXiv:2001.06320]
2019
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
On the Capacity of Private Nonlinear Computation for Replicated Databases, in Proceedings 2019 IEEE Information Theory Workshop (ITW'19), Visby, Sweden, Aug. 25–28, 2019. (Abstract
) [arXiv:2307.01772] [IEEE Xplore]
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Improved Private Information Retrieval for Coded Storage From Code Decomposition, in Proceedings 2019 IEEE Information Theory Workshop (ITW'19), Visby, Sweden, Aug. 25–28, 2019 (Invited paper). (Abstract
) [e-print] [IEEE Xplore]
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Private Polynomial Computation for Noncolluding Coded Databases, in Proceedings 2019 IEEE International Symposium on Information Theory (ISIT'19), Paris, France, Jul. 7–12, 2019, pp. 1677–1681. (Abstract
) [arXiv:1901.10286] [IEEE Xplore]
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Weakly-Private Information Retrieval, in Proceedings 2019 IEEE International Symposium on Information Theory (ISIT'19), Paris, France, Jul. 7–12, 2019, pp. 1257–1261. (Abstract
) [arXiv:1901.06730] [IEEE Xplore]
2018
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage, in Proceedings 2018 IEEE Information Theory Workshop (ITW'18), Nov. 25–29, 2018. (Abstract
) [arXiv:1806.01342] [IEEE Xplore]
Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes, in Proceedings 2018 IEEE Information Theory Workshop (ITW'18), Nov. 25–29, 2018. (Abstract
) [arXiv:1809.06648] [IEEE Xplore]
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, and Joerg Kliewer:
Capacity of Private Linear Computation for Coded Databases, in Proceedings 56th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Oct. 2–5, 2018, pp. 813–820. (Abstract
) [arXiv:1810.04230] [IEEE Xplore]
Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Connections Between the Error Probability and the r-wise Hamming Distances, in Proceedings 2018 International Symposium on Information Theory and its Applications (ISITA’18), Singapore, Oct. 28–31, 2018, pp. 130–134 (Invited paper). (Abstract
) [e-print] [IEEE Xplore]
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes, in Proceedings 2018 IEEE International Symposium on Information Theory (ISIT'18), Vail, CO, USA, Jun. 17–22, 2018, pp. 966–970. (Abstract
) [arXiv:1801.04923] [IEEE Xplore]
Dingwen Yuan, Hsuan-Yin Lin, Joerg Widmer, Matthias Hollick:
Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks, in Proceedings 2018 IEEE International Conference on Computer Communications (INFOCOM'18), Honolulu, HI, USA, Apr. 15–19, 2018, pp. 1205–1213. (Abstract
) [arXiv:1712.04059] [IEEE Xplore]
Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
The r-wise Hamming Distance and its Operational Interpretation for Block Codes, in Proceedings 52th Annual Conference on Information Sciences and Systems (CISS'18), Princeton University, Princeton, NJ, USA, Mar. 21–23, 2018 (Invited paper). (Abstract
) [e-print] [IEEE Xplore]
Hsuan-Yin Lin, Eirik Rosnes:
Lengthening and Extending Binary Private Information Retrieval Codes, in Proceedings 2018 International Zurich Seminar on Information and Communication (IZS'18), Zurich, Switzerland, Feb. 21–23, 2018, pp. 113–117. (Abstract
) [e-print] [arXiv:1707.03495]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On the Suboptimality of Perfect Quantum Stabilizer Codes over the Pauli Independent X-Z Channel, Poster session at 2018 Spring Workshop on Information Theory and Communications (ITC'18), New Taipei City, Taiwan, Jan. 25–27, 2018. [poster]
2016
Po-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin, Pramod K. Varshney:
Optimal Byzantine Attack for Distributed Inference with M-ary Quantized Data, in Proceedings 2016 IEEE International Symposium on Information Theory (ISIT'16), Barceona, Spain, Jul. 10–15, 2016, pp. 2474–2478. (Abstract
) [e-print] [IEEE Xplore]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
A Closed-Form Expression for the Exact Average Error Probability of Arbitrary Quantum Stabilizer Codes over the Quantum Channels, Poster session at 2016 Fall Workshop on Information Theory and Communications (ITC'16), Nantou, Taiwan, Aug. 18–19, 2016. [poster]
 
2015
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Nonlinear Codes Outperform the Best Linear Codes on the Binary Erasure Channel, in Proceedings 2015 IEEE International Symposium on Information Theory (ISIT'15), Hong Kong, Jun. 14–19, 2015, pp. 1751–1755. (Abstract
) [e-print] [IEEE Xplore]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
A Closed-Form Expression for the Exact Average Error Probability of Arbitrary Binary Codes over the Binary Erasure Channel, Poster session at 2015 IEEE Taiwan/Hong Kong Joint Workshop on Information Theory and Communications, Hualien, Taiwan, Jan. 22–23, 2015. [poster]
 
2014
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Optimal Ultra-Small Block-Codes on Two Special Binary Channels, Poster session at 2014 National Symposium on Telecommunication (NST'14), Taichung, Taiwan, Nov. 27–28, 2014. [poster]
Yuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser:
The Asymptotic Capacity of Noncoherent Single-Input Multiple-Output Fading Channels with Memory and Feedback, Poster session at 2014 Spring Workshop on Information Theory and Communications (ITC’14), Kaohsiung, Taiwan, Jan. 23–24, 2014. [poster]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On the Suboptimality of Equidistant Codes Meeting the Plotkin Bound, Poster session at 2014 Spring Workshop on Information Theory and Communications (ITC’14), Kaohsiung, Taiwan, Jan. 23–24, 2014. [poster]
 
2013
Yuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser:
The Asymptotic Capacity of Noncoherent Single-Input Multiple-Output Fading Channels with Memory and Feedback, in Proceedings 2013 IEEE International Symposium on Information Theory (ISIT'13), Istanbul, Turkey, Jul. 7–13, 2013, pp. 2269–2273. (Abstract
) [e-print] [IEEE Xplore]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Equidistant Codes Meeting the Plotkin Bound are Not Optimal on the Binary Symmetric Channel, in Proceedings 2013 IEEE International Symposium on Information Theory (ISIT'13), Istanbul, Turkey, Jul. 7–13, 2013, pp. 3015–3019. (Abstract
) [e-print] [IEEE Xplore]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On the Suboptimality of Equidistant Codes Meeting the Plotkin Bound, Proceedings 2013 Taiwan Spring School on Information Theory and Communications, Taipei, Taiwan, Mar. 9, 2013, pp. 20–21. [e-print]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Optimal Finite Blocklength Code Design on the Binary Erasure Channel, Poster session at 2013 IEEE Taiwan/Hong Kong Joint Workshop on Information Theory and Communications, Hong Kong, Jan. 19–20, 2013. [poster]
 
2012
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Weak Flip Codes and Applications to Optimal Code Design on the Binary Erasure Channel, in Proceedings 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton House, Monticello, IL, USA, Oct. 1–5, 2012, pp. 160–167. (Abstract
) [e-print] [IEEE Xplore]
 
2011
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Ultra-Small Block-Codes for Binary Discrete Memoryless Channels, in Proceedings 2011 IEEE Information Theory Workshop (ITW'11), Paraty, Brazil, Oct. 16–20, 2011, pp. 175–179. (Abstract
) [e-print] [IEEE Xplore]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On Ultra-Short Block-Codes on Two Special Binary Channels, Poster session at 2011 Spring Workshop on Information Theory and Communications (ITC'11), Sanhsia, Taiwan, Jan. 24–25, 2011. [poster]
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On Ultra-Short Block-Codes on the Binary Asymmetric Channel, Proceedings 2011 Taiwan Winter School on Information Theory and Communications, Hsinchu, Taiwan, Jan. 17, 2011, pp. 1–2. [e-print]
 
2010
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
On Ultra-Short Block-Codes on the Binary Asymmetric Channel, Poster session at 2010 Fall Workshop on Information Theory and Communications (ITC'10), Kinmen, Taiwan, Aug. 23–24, 2010. [poster]

Reports

2018
Hsuan-Yin Lin:
On the Proof of Minimum r-Wise Distance for Linear Codes, Jun. 8, 2018. [e-print]
2017
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Exact Error Performance Analysis of Block-Codes On the Binary Erasure Channel, final report of project Optimal Code Design That Minimizes The Maximum-Likelihood Decoding Error Over Classical and Quantum Channels (proj.no.: MOST 104–2221–E–009–077–MY2), funded by Ministry of Science and Technology (MOST), Taiwan, October 31, 2017.
2016
Po-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin:
Optimal Byzantine Attack Policy for Distributed Inference with M-ary Quantized Data, final report of project Inference Security in Wireless Sensor Networks (New Partnership Program for the Connection to the Top Labs in the World) (proj.no.: MOST 104-2911-I-011-503), funded by Ministry of Science and Technology (MOST), Taiwan, November 30, 2016.
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Exact Error Performance Analysis of Block-Codes On the Binary Erasure Channel, intermediate report of project Optimal Code Design That Minimizes The Maximum-Likelihood Decoding Error Over Classical and Quantum Channels (proj.no.: MOST 104–2221–E–009–077–MY2), funded by Ministry of Science and Technology (MOST), Taiwan, May 31, 2016.
 
2015
Po-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin:
Random Deployment Analysis for Target Localization in Wireless Sensor Networks Using Error Correcting Codes, intermediate report of project Inference Security in Wireless Sensor Networks (New Partnership Program for the Connection to the Top Labs in the World) (proj.no.: MOST 103-2911-I-011-515), funded by Ministry of Science and Technology (MOST), Taiwan, August 31, 2015.
 
2014
Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Weak Flip Codes and its Optimality on the Binary Erasure Channel, final report of project Ultra-Short Blocklength Communication (proj.-no.: NSC 100-2221-E-009-068-MY3), funded by Ministry of Science and Technology (MOST, former NSC), Taiwan, November 1, 2014.
 
2013
Stefan M. Moser:
Weak Flip Codes and Applications to Optimal Code Design on the Binary Erasure Channel, intermediate report of project Ultra-Short Blocklength Communication (proj.-no.: NSC 100-2221-E-009-068-MY3), funded by National Science Council, Taiwan, co-authored by Po-Ning Chen and Hsuan-Yin Lin, May 31, 2013.
 
2012
Stefan M. Moser:
Optimal Ultra-Small Block-Codes for Binary Discrete Memoryless Channels, intermediate report of project Ultra-Short Blocklength Communication (proj.-no.: NSC 100-2221-E-009-068-MY3), funded by National Science Council, Taiwan, co-authored by Po-Ning Chen and Hsuan-Yin Lin, May 31, 2012.
Stefan M. Moser:
Error Probability Analysis of Binary Asymmetric Channels, final report of project Finite Blocklength Capacity (proj.-no.: NSC 97-2221-E-009-003-MY3), funded by National Science Council, Taiwan, co-authored by Po-Ning Chen and Hsuan-Yin Lin, January 31, 2012.
 
2010
Stefan M. Moser:
Error Probability Analysis of Binary Asymmetric Channels, intermediate report of project Finite Blocklength Capacity (proj.-no.: NSC 97-2221-E-009-003-MY3), funded by National Science Council, Taiwan, co-authored by Po-Ning Chen and Hsuan-Yin Lin, May 31, 2010.
 
2009
Stefan M. Moser:
Error Probability Analysis of Binary Asymmetric Channels, intermediate report of project Finite Blocklength Capacity (proj.-no.: NSC 97-2221-E-009-003-MY3), funded by National Science Council, Taiwan, co-authored by Po-Ning Chen and Hsuan-Yin Lin, May 31, 2009.

Ph.D. Thesis

Hsuan-Yin Lin:
Optimal Ultra-Small Block-Codes for Binary Input Discrete Memoryless Channels, Ph.D. Thesis, Information Theory Lab, Institute of Communications Engineering, NCTU, Taiwan, June 2013, supervised by Prof. Dr. Stefan M. Moser and Prof. Dr. Po-Ning Chen. (Abstracts)

Supervised Theses

Eirik Rygnestad Bergesen:
Simulating Private Information Retrieval on Amazon Web Services, Master thesis, Department of Informatics, The University of Bergen, Norway, September 2023. (Abstract)
 
Palma Rud Persson:
Tail-biting Codes for Lattice Wiretap Coding, Master thesis, Department of Informatics, The University of Bergen, Norway, June 2023. (Abstract)
 
Maria van der Reek Lidsheim:
Introduction to Lattices and Its Applications in Compute-and-Forward Strategy, Master thesis, Department of Informatics, The University of Bergen, Norway, June 2023. (Abstract)
 
Sondre Eide Omland:
Deep Reinforcement Learning for Computation Offloading in Mobile Edge Computing, Master thesis, Department of Informatics, The University of Bergen, Norway, June 2022. (Abstract)
 
Christopher Hærem:
Neural Networks for Lossy Weakly-Private Information Retrieval, Master thesis, Department of Informatics, The University of Bergen, Norway, June 2021. (Abstract)

Co-Authors (alphabetically)


Copyright

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.