On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel with Degraded Message Sets
- 1 November 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 141-145
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. Csiszar and Narayan's result for the single- user 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 nonsymmetrizability 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.Keywords
This publication has 7 references indexed in Scilit:
- Reliable communication under channel uncertaintyIEEE Transactions on Information Theory, 1998
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Exponential error bounds for random codes in the arbitrarily varying channelIEEE Transactions on Information Theory, 1985
- Coding of arbitrarily varying multiuser channelsIEEE Transactions on Information Theory, 1981
- Universally attainable error exponents for broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1980
- Elimination of correlation in random codes for arbitrarily varying channelsProbability Theory and Related Fields, 1978
- General broadcast channels with degraded message setsIEEE Transactions on Information Theory, 1977