Lei Yu

activity

20162020

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

7 citations · 9 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2020

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering

Lei Yu, Xinmin Hou, Boyuan Liu +1

Given two $3$ -graphs $F$ and $H$ , an $F$ -covering of $H$ is a collection of copies of $F$ in $H$ such that each vertex of $H$ is contained in at least one copy of them. Let {$c_2(n…

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 $n$ and $1 \leq M \leq 2^{n}$ , determine the minimum average Hamming distance of binary…

cs.IT2016★ 2 cited

Distortion Bounds for Transmitting Correlated Sources with Common Part over MAC

Lei Yu, Houqiang Li, Chang Wen Chen

This paper investigates the joint source-channel coding problem of sending two correlated memoryless sources with common part over a memoryless multiple access channel (MAC). An in…

Exact minimum codegree thresholds for K4−​-covering and K5−​-covering

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

Distortion Bounds for Transmitting Correlated Sources with Common Part over MAC

Exact minimum codegree thresholds for $K_{4}^{-}$ -covering and $K_{5}^{-}$ -covering