On the deterministic-code capacity of the two-user discrete memoryless arbitrarily varying general broadcast channel with degraded message sets

Eran Hof, Shraga I. Bross

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

An inner bound on the deterministic-code capacity region of the two-user discrete memoryless arbitrarily varying general broadcast channel (AVGBC) was characterized by Jahn, assuming that the common message capacity is nonzero; however, he did not indicate how one could decide whether the latter capacity is positive. Csiszár and Narayan's result for the single-user arbitrarily varying channel (AVC) establishes the missing part in Jahn's characterization. Nevertheless, being based on Ahlswede's elimination technique, Jahn's characterization is not applicable for symmetrizable channels under state constraint. Here, the various notions of symmetrizability for the two-user broadcast AVC are defined. Sufficient non-symmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's. The decoding rules we use establish an achievable region under state and input constraints for the family of degraded message sets codes over the AVGBC.

Original languageEnglish
Pages (from-to)5023-5044
Number of pages22
JournalIEEE Transactions on Information Theory
Volume52
Issue number11
DOIs
StatePublished - Nov 2006
Externally publishedYes

Keywords

  • Arbitrarily varying channel (AVC)
  • Broadcast channel
  • Degraded message sets
  • Deterministic coding
  • Symmetrizability conditions

Fingerprint

Dive into the research topics of 'On the deterministic-code capacity of the two-user discrete memoryless arbitrarily varying general broadcast channel with degraded message sets'. Together they form a unique fingerprint.

Cite this