Publication

On degraded two-message set broadcast

Christina Fragouli, Suhas Diggavi, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran
2009
Conference Papers

Abstract

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.

Official source

https://infoscience.epfl.ch/entities/publication/f45d28b0-90bf-4306-8767-9018f34fc065

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On degraded two-message set broadcast

Chat with Graph Search

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Hang With Your Buddies to Resist Intersection Attacks

Broadcasting and Multicasting Nested Message Sets