Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources

DOI10.3934/amc.2016009zbMath1348.94020OpenAlexW2346028882MaRDI QIDQ326306

Rafael F. Schaefer, Holger Boche

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2016009

zbMATH Keywords

derandomizationarbitrarily varying multiple access channelcapacity regionconferencing encoderscoordination resourceslist decoding

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (2)

Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources ⋮ The secrecy capacity of the arbitrarily varying wiretap channel under list decoding

Cites Work

• Unnamed Item
• Unnamed Item
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• The classical-quantum multiple access channel with conferencing encoders and with common messages
• Efficient list decoding of a class of algebraic-geometry codes
• Simultaneous channels
• List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
• Capacity of the arbitrarily varying channel under list decoding
• On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
• List Decoding for Arbitrarily Varying Broadcast Channels With Receiver Side Information
• On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding
• The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders
• The Capacity of a Class of Channels
• On the deterministic-code capacity of the multiple-access arbitrarily varying channel
• Arbitrarily varying channels with states sequence known to the sender
• The capacity of the arbitrarily varying channel revisited: positivity, constraints
• Coding of arbitrarily varying multiuser channels
• Two proofs of Pinsker's conjecture concerning arbitrarily varying channels
• Elimination of correlation in random codes for arbitrarily varying channels
• The smallest list for the arbitrarily varying channel
• Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
• The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)
• Capacity Results for Arbitrarily Varying Wiretap Channels
• List-Decoding for the Arbitrarily Varying Channel Under State Constraints
• The Compound Multiple Access Channel With Partially Cooperating Encoders
• The Capacities of Certain Channel Classes Under Random Coding

This page was built for publication: Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources