Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. An information theory for erasure channels (invited paper)
 
Loading...
Thumbnail Image
conference paper not in proceedings

An information theory for erasure channels (invited paper)

Salamatian, Mohammad Reza
•
Khalili, Ramin
2005
Allerton

In this paper we present a rapid review of known results in the context of different scenario of the erasure channel. We will also give a converse capacity bound for relay channel showing that the cut-set bound is not attainable in general by any fixed coding scheme for the single sender-single relay case. This bound shows the difference between the degraded situation where the cut-set bound is attainable and some specific case of the non-degraded situation where the cut-set bound is not attainable. The obtained reverse bound could be used for deriving tighter cut-set type bound for general multi-terminal erasure channels.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

allertoninvited05.pdf

Access type

openaccess

Size

646.7 KB

Format

Adobe PDF

Checksum (MD5)

ec7d1b929cedfa51dd0027a7c717acf9

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés