2 papers
cs.IT2023
Reliable computation by large-alphabet formulas in the presence of noise
Andrew K. Tan, Matthew Ho, Isaac L. Chuang
We present two new positive results for reliable computation using formulas over physical alphabets of size . First, we show that for logical alphabets of size th…
cs.IT2021
On the binary adder channel with complete feedback, with an application to quantitative group testing
Samuel H. Florin, Matthew H. Ho, Zilin Jiang
We determine the exact value of the optimal symmetric rate point in the Dueck zero-error capacity region of the binary adder channel with complete feedback. We proved that…