24 citations · 99 across the 36 of their papers we have counts for
38 papers
A Spectrum-Based Converse for Quantum State Discrimination and Its Applications to Classical-Quantum Channel Coding
Tam{á}s Havas, Hsuan-Yin Lin, Eirik Rosnes
We investigate converse bounds on the average decoding error probability in finite-blocklength classical-quantum channel coding. We first present a lower bound for multiple quantum…
Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes
Eugenio Durazo Rocha, Olai Å. Mostad, Hsuan-Yin Lin +1
Low-depth syndrome extraction for Calderbank-Shor-Steane (CSS) quantum low-density parity-check codes can be formulated as a proper ordered edge-coloring problem subject to quantum…
On Constructing and Decoding Quantum Triorthogonal Codes
Alessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin +2
Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical gates. As a non-Clifford operation, the $\…
Improved Decoding of Quantum Tanner Codes Using Generalized Check Nodes
Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin
We study the decoding problem for quantum Tanner codes and propose to exploit the underlying local code structure by grouping check nodes into more powerful generalized check nodes…
Communication-Constrained Private Decentralized Online Personalized Mean Estimation
Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes +1
We consider the problem of communication-constrained collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receivin…
On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors
Tamás Havas, Hsuan-Yin Lin, Eirik Rosnes +1
We investigate practical finite-blocklength classical-quantum channel coding over the quantum amplitude damping channel (ADC), aiming to transmit classical information reliably thr…
Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes
Olai Å. Mostad, Hsuan-Yin Lin, Eirik Rosnes +2
Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum…
Differentially-Private Collaborative Online Personalized Mean Estimation
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin +2
We consider the problem of collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receiving data according to arbitr…
Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel
Hsuan-Yin Lin, Yi-Sheng Su, Mao-Ching Chiu
We investigate practical short-blocklength coding for the semi-deterministic binary erasure wiretap channel (BE-WTC), where the main channel to the legitimate receiver is noiseless…
Generalizing Quantum Tanner Codes
Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Zémor, which contains a construction of asymptotically good quantum LDPC co…
Improved Capacity Outer Bound for Private Quadratic Monomial Computation
Karen M. Dæhli, Sarah A Obead, Hsuan-Yin Lin +1
In private computation, a user wishes to retrieve a function evaluation of messages stored on a set of databases without revealing the function's identity to the databases. Obead \…
Weakly-Private Information Retrieval From MDS-Coded Distributed Storage
Asbjørn O. Orvedal, Hsuan-Yin Lin, Eirik Rosnes
We consider the problem of weakly-private information retrieval (WPIR) when data is encoded by a maximum distance separable code and stored across multiple servers. In WPIR, a user…
On the Capacity of Private Nonlinear Computation for Replicated Databases
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes +1
We consider the problem of private computation (PC) in a distributed storage system. In such a setting a user wishes to compute a function of messages replicated across non…
Efficient Interpolation-Based Decoding of Reed-Solomon Codes
Wrya K. Kadir, Hsuan-Yin Lin, Eirik Rosnes
We propose a new interpolation-based error decoding algorithm for Reed-Solomon (RS) codes over a finite field of size , where is the length and is the dimens…
Single-Server Pliable Private Information Retrieval With Side Information
Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes
We study the problem of pliable private information retrieval with side information (PPIR-SI) for the single server case. In PPIR, the messages are partitioned into nonoverlapping…
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Recently, a design criterion depending on a lattice's volume and theta series, called the secrecy gain, was proposed to quantify the secrecy-goodness of the applied lattice code fo…
Straggler-Resilient Differentially-Private Decentralized Learning
Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin +2
We consider the straggler problem in decentralized learning over a logical ring while preserving user data privacy. Especially, we extend the recently proposed framework of differe…
Formally Unimodular Packings for the Gaussian Wiretap Channel
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
This paper introduces the family of lattice-like packings, which generalizes lattices, consisting of packings possessing periodicity and geometric uniformity. The subfamily of form…
On the Secrecy Gain of Formally Unimodular Construction Lattices
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper fr…
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel
Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus
We consider lattice coding for the Gaussian wiretap channel, where the challenge is to ensure reliable communication between two authorized parties while preventing an eavesdropper…
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval
Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes +1
Private information retrieval protocols guarantee that a user can privately and losslessly retrieve a single file from a database stored across multiple servers. In this work, we p…
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval
Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin +2
We propose to extend the concept of private information retrieval by allowing for distortion in the retrieval process and relaxing the perfect privacy requirement at the same time.…
Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks
Dingwen Yuan, Hsuan-Yin Lin, Jörg Widmer +1
Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment o…
Multi-Server Weakly-Private Information Retrieval
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes +2
Private information retrieval (PIR) protocols ensure that a user can download a file from a database without revealing any information on the identity of the requested file to the…