136 citations · 151 across the 4 of their papers we have counts for
6 papers
Private Information Retrieval for Coded Storage
Terence H. Chan, Siu-Wai Ho, Hirosuke Yamamoto
Private information retrieval scheme for coded data storage is considered in this paper. We focus on the case where the size of each data record is large and hence only the downloa…
Error Free Perfect Secrecy Systems
Siu-Wai Ho, Terence H. Chan, Alex Grant +1
Shannon's fundamental bound for perfect secrecy says that the entropy of the secret message cannot be larger than the entropy of the secret key initially shared by the sender and t…
Capacity Analysis of Linear Operator Channels over Finite Fields
Shenghao Yang, Siu-Wai Ho, Jin Meng +1
Motivated by communication through a network employing linear network coding, capacities of linear operator channels (LOCs) with arbitrarily distributed transfer matrices over fini…
Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources
Amin Aminzadeh Gohari, Shenghao Yang, Sidharth Jaggi
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of…
Markov Lemma for Countable Alphabets
Siu-Wai Ho
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only,…
On Linear Operator Channels over Finite Fields
Shenghao Yang, Siu-Wai Ho, Jin Meng +2
Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such…