TY - JOUR
T1 - On the deterministic-code capacity of the two-user discrete memoryless arbitrarily varying general broadcast channel with degraded message sets
AU - Hof, Eran
AU - Bross, Shraga I.
PY - 2006/11
Y1 - 2006/11
N2 - 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.
AB - 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.
KW - Arbitrarily varying channel (AVC)
KW - Broadcast channel
KW - Degraded message sets
KW - Deterministic coding
KW - Symmetrizability conditions
UR - http://www.scopus.com/inward/record.url?scp=33750578859&partnerID=8YFLogxK
U2 - 10.1109/TIT.2006.883543
DO - 10.1109/TIT.2006.883543
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:33750578859
SN - 0018-9448
VL - 52
SP - 5023
EP - 5044
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 11
ER -