3 papers
cs.IT2019
Can Marton Coding Alone Ensure Individual Secrecy?
Jin Yeong Tan, Lawrence Ong, Behzad Asadi
For communications in the presence of eavesdroppers, random components are often used in code design to camouflage information from eavesdroppers. In broadcast channels without eav…
cs.IT2018
The Secure Two-Receiver Broadcast Channel With One-Sided Receiver Side Information
Jin Yeong Tan, Lawrence Ong, Behzad Asadi
This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesd…
cs.IT2018
Centralized Caching with Unequal Cache Sizes
Behzad Asadi, Lawrence Ong, Sarah J. Johnson
We address a centralized caching problem with unequal cache sizes. We consider a system with a server of files connected through a shared error-free link to a group of cache-enable…