98 citations · 219 across the 62 of their papers we have counts for
5 papers · 1 filter
Efficient Algorithms for the Bee-Identification Problem
Han Mao Kiah, Alexander Vardy, Hanwen Yao
The bee-identification problem, formally defined by Tandon, Tan and Varshney (2019), requires the receiver to identify "bees" using a set of unordered noisy measurements. In this p…
Verifiable Coded Computation of Multiple Functions
Wilton Kim, Stanislav Kruglik, Han Mao Kiah
We consider the problem of evaluating distinct multivariate polynomials over several massive datasets in a distributed computing system with a single master node and multiple worke…
Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols
Han Mao Kiah, Wilton Kim, Stanislav Kruglik +2
Motivated by applications in distributed storage, distributed computing, and homomorphic secret sharing, we study communication-efficient schemes for computing linear combinations…
Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight
Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah +2
In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given , we study (i) The -bounded constraint: a binary vector of size …
Average Redundancy of Variable-Length Balancing Schemes à la Knuth
Duc Tu Dao, Han Mao Kiah, Tuan Thanh Nguyen
We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the avera…