Han Mao Kiah

Average Redundancy of Variable-Length Balancing Schemes à la Knuth

2022 · arXiv (Cornell University)

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 average number of redundant bits incurred by our schemes. In addition to the …

Verifiable Coded Computation of Multiple Functions

2022 · arXiv (Cornell University)

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 worker nodes. We focus on the general case when each …