Results 11 to 20 of about 95,619 (236)
Identification Over Quantum Broadcast Channels [PDF]
arXiv, 2022 Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential code size.
Johannes Rosenberger +2 more
arxiv +4 more sources
Secrecy in Cooperative Relay Broadcast Channels [PDF]
arXiv, 2008 We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward ...
Sennur Ulukus, Ersen Ekrem
arxiv +5 more sources
2023 IEEE International Symposium on Information Theory (ISIT), 2023 We study the problem of random-assisted simulation of discrete broadcast channel in one-shot and i.i.d. setups. We derive one-shot inner and outer bounds of the set of attainable message-size pairs for simulating W YZ|X within some total variation distance (TVD) tolerance of ϵ. The inner bounds are based on the bipartite convex split lemma. Whereas the
Cao, Michael X. +3 more
openaire +2 more sources
Quantum Broadcast Channels [PDF]
IEEE Transactions on Information Theory, 2011 15 pages; IEEE Trans. Inform. Theory, vol. 57, no.
Igor Devetak, Jon Yard, Patrick Hayden
openaire +4 more sources
Polar Codes for Broadcast Channels [PDF]
IEEE Transactions on Information Theory, 2013 Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while satisfying broadcast constraints.
Naveen Goela +2 more
openaire +5 more sources
Individual Secrecy for the Broadcast Channel [PDF]
IEEE Transactions on Information Theory, 2017 This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message (i.e., the information leakage from each message ...
Yanling Chen +2 more
openaire +4 more sources
Cooperative relay broadcast channels [PDF]
2005 International Conference on Wireless Networks, Communications and Mobile Computing, 2005 Submitted to the IEEE Transactions on Information Theory, July ...
Yingbin Liang, Venugopal V. Veeravalli
openaire +5 more sources
Multi-channel broadcast encryption [PDF]
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, 2013 Broadcast encryption aims at sending a content to a large arbitrary group of users at once. Currently, the most efficient schemes provide constant-size headers, that encapsulate ephemeral session keys under which the payload is encrypted. However, in practice, and namely for pay-TV, providers have to send various contents to different groups of users ...
Phan, Duong Hieu +2 more
openaire +4 more sources
Identification via the broadcast channel [PDF]
2014 IEEE International Symposium on Information Theory, 2014 83 pages, a shorter version is published in the IEEE Transactions on Information ...
Annina Bracher, Amos Lapidoth
openaire +5 more sources
Broadcast Channels With Cooperating Decoders [PDF]
IEEE Transactions on Information Theory, 2006 Final version, to appear in the IEEE Transactions on Information Theory -- contains (very) minor changes based on the last round of ...
Ron Dabora, Sergio D. Servetto
openaire +4 more sources