# American Institute of Mathematical Sciences

• Previous Article
Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
• AMC Home
• This Issue
• Next Article
On $\omega$-cyclic-conjugated-perfect quaternary GDJ sequences
May  2016, 10(2): 333-354. doi: 10.3934/amc.2016009

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

 1 Lehrstuhl für Theoretische Informationstechnik, Technische Universität München, 80290 München, Germany 2 Information Theory and Applications Chair, Technische Universität Berlin, Einsteinufer 25, 10587 Berlin, Germany

Received  May 2014 Published  April 2016

Communication over channels that may vary in an arbitrary and unknown manner from channel use to channel use is studied. Such channels fall in the framework of arbitrarily varying channels (AVCs), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. However, more sophisticated strategies such as common randomness (CR) assisted codes or list decoding are capable to resolve the ambiguity induced by symmetrizable AVCs. AVCs further serve as the indispensable basis for modeling adversarial attacks such as jamming in information theoretic security related communication problems. In this paper, we study the arbitrarily varying multiple access channel (AVMAC) with conferencing encoders, which models the communication scenario with two cooperating transmitters and one receiver. This can be motivated for example by cooperating base stations or access points in future systems. The capacity region of the AVMAC with conferencing encoders is established and it is shown that list decoding allows for reliable communication also for symmetrizable AVMACs. The list capacity region equals the CR-assisted capacity region for large enough list size. Finally, for fixed probability of decoding error the amount of resources, i.e., CR or list size, is quantified and shown to be finite.
Citation: Holger Boche, Rafael F. Schaefer. Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources. Advances in Mathematics of Communications, 2016, 10 (2) : 333-354. doi: 10.3934/amc.2016009
##### References:

show all references

##### References:
 [1] Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer. The secrecy capacity of the arbitrarily varying wiretap channel under list decoding. Advances in Mathematics of Communications, 2019, 13 (1) : 11-39. doi: 10.3934/amc.2019002 [2] Peter Beelen, Kristian Brander. Efficient list decoding of a class of algebraic-geometry codes. Advances in Mathematics of Communications, 2010, 4 (4) : 485-518. doi: 10.3934/amc.2010.4.485 [3] Henry Cohn, Nadia Heninger. Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. Advances in Mathematics of Communications, 2015, 9 (3) : 311-339. doi: 10.3934/amc.2015.9.311 [4] Lizhong Peng, Shujun Dang, Bojin Zhuang. Localization operator and digital communication capacity of channel. Communications on Pure & Applied Analysis, 2007, 6 (3) : 819-827. doi: 10.3934/cpaa.2007.6.819 [5] Joan-Josep Climent, Diego Napp, Raquel Pinto, Rita Simões. Decoding of $2$D convolutional codes over an erasure channel. Advances in Mathematics of Communications, 2016, 10 (1) : 179-193. doi: 10.3934/amc.2016.10.179 [6] Cheng Ma, Y. C. E. Lee, Chi Kin Chan, Yan Wei. Auction and contracting mechanisms for channel coordination with consideration of participants' risk attitudes. Journal of Industrial & Management Optimization, 2017, 13 (2) : 775-801. doi: 10.3934/jimo.2016046 [7] Jonas Eriksson. A weight-based characterization of the set of correctable error patterns under list-of-2 decoding. Advances in Mathematics of Communications, 2007, 1 (3) : 331-356. doi: 10.3934/amc.2007.1.331 [8] Fernando Hernando, Tom Høholdt, Diego Ruano. List decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes. Advances in Mathematics of Communications, 2012, 6 (3) : 259-272. doi: 10.3934/amc.2012.6.259 [9] Alexey Frolov, Victor Zyablov. On the multiple threshold decoding of LDPC codes over GF(q). Advances in Mathematics of Communications, 2017, 11 (1) : 123-137. doi: 10.3934/amc.2017007 [10] Chuan Ding, Kaihong Wang, Shaoyong Lai. Channel coordination mechanism with retailers having fairness preference ---An improved quantity discount mechanism. Journal of Industrial & Management Optimization, 2013, 9 (4) : 967-982. doi: 10.3934/jimo.2013.9.967 [11] Yuan Zhao, Wuyi Yue. Performance evaluation and optimization of cognitive radio networks with adjustable access control for multiple secondary users. Journal of Industrial & Management Optimization, 2019, 15 (1) : 1-14. doi: 10.3934/jimo.2018029 [12] Nina Yan, Tingting Tong, Hongyan Dai. Capital-constrained supply chain with multiple decision attributes: Decision optimization and coordination analysis. Journal of Industrial & Management Optimization, 2019, 15 (4) : 1831-1856. doi: 10.3934/jimo.2018125 [13] Wai-Ki Ching, Sin-Man Choi, Min Huang. Optimal service capacity in a multiple-server queueing system: A game theory approach. Journal of Industrial & Management Optimization, 2010, 6 (1) : 73-102. doi: 10.3934/jimo.2010.6.73 [14] Hongbiao Fan, Jun-E Feng, Min Meng. Piecewise observers of rectangular discrete fuzzy descriptor systems with multiple time-varying delays. Journal of Industrial & Management Optimization, 2016, 12 (4) : 1535-1556. doi: 10.3934/jimo.2016.12.1535 [15] Kwankyu Lee. Decoding of differential AG codes. Advances in Mathematics of Communications, 2016, 10 (2) : 307-319. doi: 10.3934/amc.2016007 [16] Tone Arnold, Myrna Wooders. Dynamic club formation with coordination. Journal of Dynamics & Games, 2015, 2 (3&4) : 341-361. doi: 10.3934/jdg.2015010 [17] Alain Bensoussan, Sonny Skaaning. Base stock list price policy in continuous time. Discrete & Continuous Dynamical Systems - B, 2017, 22 (1) : 1-28. doi: 10.3934/dcdsb.2017001 [18] Jeremias Epperlein, Vladimír Švígler. On arbitrarily long periodic orbits of evolutionary games on graphs. Discrete & Continuous Dynamical Systems - B, 2018, 23 (5) : 1895-1915. doi: 10.3934/dcdsb.2018187 [19] M. Núñez-López, J. X. Velasco-Hernández, P. A. Marquet. The dynamics of technological change under constraints: Adopters and resources. Discrete & Continuous Dynamical Systems - B, 2014, 19 (10) : 3299-3317. doi: 10.3934/dcdsb.2014.19.3299 [20] Elisa Gorla, Felice Manganiello, Joachim Rosenthal. An algebraic approach for decoding spread codes. Advances in Mathematics of Communications, 2012, 6 (4) : 443-466. doi: 10.3934/amc.2012.6.443

2018 Impact Factor: 0.879