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

DOI10.3934/AMC.2016009zbMATH Open1348.94020OpenAlexW2346028882MaRDI QIDQ326306FDOQ326306

Authors: Holger Boche, Rafael F. Schaefer 

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

Recommendations

• On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders
• The smallest list for the arbitrarily varying channel
• Capacity of the arbitrarily varying channel under list decoding
• The maximal error capacity of arbitrarily varying channels for constant list sizes
• The secrecy capacity of the arbitrarily varying wiretap channel under list decoding

zbMATH Keywords

derandomizationarbitrarily varying multiple access channelcapacity regionconferencing encoderscoordination resourceslist decoding

Mathematics Subject Classification ID

Source coding (94A29)

Cites Work

• 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
• Bridging Shannon and Hamming: list error-correction with optimal rate
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• 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
• Title not available (Why is that?)
• 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.)
• The classical-quantum multiple access channel with conferencing encoders and with common messages
• 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
• Efficient list decoding of a class of algebraic-geometry codes
• The Capacities of Certain Channel Classes Under Random Coding

Cited In (7)

• The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
• Impact of interference in coexisting wireless networks with applications to arbitrarily varying bidirectional broadcast channels
• Structured Mappings and Conferencing Common Information for Multiple-Access Channels
• The smallest list for the arbitrarily varying channel
• List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders

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

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