activity
20152026
most citedAn Improved Linear Programming Bound on the Average Distance of a Binary Code

7 citations · 10 across the 8 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 7 cited

An Improved Linear Programming Bound on the Average Distance of a Binary Code

Lei Yu, Vincent Y. F. Tan

Ahlswede and Katona (1977) posed the following isodiametric problem in Hamming spaces: For every and , determine the minimum average Hamming distance of binary…

cs.IT2019

On Non-Interactive Simulation of Binary Random Variables

Lei Yu, Vincent Y. F. Tan

We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables.…