Coding of arbitrarily varying multiuser channels

DOI10.1109/TIT.1981.1056320MaRDI QIDQ3924089zbMATH OpenFDO

Authors Johann-Heinrich Jahn

Publication date 1981

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1981.1056320

zbMATH Keywords

achievable ratebroadcast channelcapacity regionmultiple-access channel

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited in

(4)

• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Coding of arbitrarily varying multiuser channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3924089)