146 citations · 267 across the 27 of their papers we have counts for
3 papers · 1 filter
Tight Bound on Randomness for Violating the CHSH Inequality
Yifeng Teng, Shenghao Yang, Siwei Wang +1
Free will (or randomness) has been studied to achieve loophole-free Bell's inequality test and to provide device-independent quantum key distribution security proofs. The required…
Coding for Network-Coded Slotted ALOHA
Shenghao Yang, Yi Chen, Soung Chang Liew +1
Slotted ALOHA can benefit from physical-layer network coding (PNC) by decoding one or multiple linear combinations of the packets simultaneously transmitted in a timeslot, forming…
Comments on Cut-Set Bounds on Network Function Computation
Cupjin Huang, Zihan Tan, Shenghao Yang +1
A function computation problem in directed acyclic networks has been considered in the literature, where a sink node wants to compute a target function with the inputs generated at…