{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:26Z","timestamp":1774679486712,"version":"3.50.1"},"reference-count":98,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:00:00Z","timestamp":1558483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1285\/16"],"award-info":[{"award-number":["1285\/16"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We study the arbitrarily varying relay channel, which models communication with relaying in the presence of an active adversary. We establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under which the deterministic code capacity is determined as well. In addition, we consider the arbitrarily varying Gaussian relay channel with sender frequency division under input and state constraints. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. Furthermore, we show that as opposed to previous relay models, the primitive relay channel has a different behavior compared to the non-primitive relay channel in the arbitrarily varying scenario.<\/jats:p>","DOI":"10.3390\/e21050516","type":"journal-article","created":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T03:22:03Z","timestamp":1558581723000},"page":"516","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Arbitrarily Varying Relay Channel"],"prefix":"10.3390","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3259-6094","authenticated-orcid":false,"given":"Uzi","family":"Pereg","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2014Israel Institute of Technology, Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossef","family":"Steinberg","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion\u2014Israel Institute of Technology, Haifa 32000, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,5,22]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.2307\/1426331","article-title":"Three-terminal communication channels","volume":"3","year":"1971","journal-title":"Adv. Appl. Probab."},{"key":"ref_2","unstructured":"Kim, Y.H. (2007, January 26\u201328). Coding techniques for primitive relay channels. Proceedings of the Allerton Conference on Communication, Control and Computing, Monticello, IL, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","article-title":"Capacity theorems for the relay channel","volume":"25","author":"Cover","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1109\/TIT.2005.846438","article-title":"Capacity of a class of relay channels with orthogonal components","volume":"51","author":"Gamal","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"4786","DOI":"10.1109\/TIT.2014.2328591","article-title":"A New Upper Bound on the Capacity of a Primitive Relay Channel Based on Channel Simulation","volume":"60","author":"Xue","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","unstructured":"Wu, X., and \u00d6zg\u00fcr, A. (October, January 29). Cut-set bound is loose for Gaussian relay networks. Proceedings of the Allerton Conference on Communication, Control and Computing, Monticello, IL, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"7708","DOI":"10.1109\/TIT.2017.2760620","article-title":"Zero-Error Relaying for Primitive Relay Channels","volume":"63","author":"Chen","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TIT.2017.2731963","article-title":"Cut-set bound is loose for Gaussian relay networks","volume":"64","author":"Wu","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1109\/TIT.2018.2876892","article-title":"\u201cThe Capacity of the Relay Channel\u201d: Solution to Cover\u2019s Problem in the Gaussian Case","volume":"65","author":"Wu","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Mondelli, M., Hassani, S.H., and Urbanke, R. (2018, January 17\u201322). A New Coding Paradigm for the Primitive Relay Channel. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192018), Talisa Hotel in Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437479"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/j.aeue.2018.06.029","article-title":"Gaussian degraded relay channel with lossy state reconstruction","volume":"93","author":"Ramachandran","year":"2018","journal-title":"AEU Int. J. Electr. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Chen, Z., Fan, P., Wu, D., Xiong, K., and Letaief, K.B. (2014, January 8\u201312). On the achievable rates of full-duplex Gaussian relay channel. Proceedings of the Global Communication Conference (GLOBECOM\u20192014), Austin, TX, USA.","DOI":"10.1109\/GLOCOM.2014.7037490"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"4721","DOI":"10.1109\/TIT.2015.2457904","article-title":"Capacity Approximations for Gaussian Relay Networks","volume":"61","author":"Kolte","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1109\/TIT.2016.2632625","article-title":"The Approximate Capacity of the MIMO Relay Channel","volume":"63","author":"Jin","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wu, X., Barnes, L.P., and \u00d6zg\u00fcr, A. (2017, January 25\u201330). The geometry of the relay channel. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192017), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006926"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4005","DOI":"10.1109\/TIT.2008.928272","article-title":"The relay\u2013eavesdropper channel: Cooperation for secrecy","volume":"54","author":"Lai","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Yeoh, P.L., Yang, N., and Kim, K.J. (2015, January 6\u201310). Secrecy outage probability of selective relaying wiretap channels with collaborative eavesdropping. Proceedings of the Global Communication Conference (GLOBECOM\u20192015), San Diego, CA, USA.","DOI":"10.1109\/GLOCOM.2015.7417082"},{"key":"ref_19","unstructured":"Kramer, G., and van Wijngaarden, A.J. (2000, January 25\u201330). On the white Gaussian multiple-access relay channel. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192000), Sorrento, Italy."},{"key":"ref_20","unstructured":"Schein, B.E. (2001). Distributed Coordination in Network Information Theory. [Ph.D. Thesis, Massachusetts Institute of Technology]."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Rankov, B., and Wittneben, A. (2006, January 9\u201314). Achievable Rate Regions for the Two-way Relay Channel. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192006), Seattle, WA, USA.","DOI":"10.1109\/ISIT.2006.261638"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.2012.2219156","article-title":"The Multiway Relay Channel","volume":"59","author":"Gunduz","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","unstructured":"Maric, I., and Yates, R.D. (July, January 27). Forwarding strategies for Gaussian parallel-relay networks. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192004), Chicago, IL, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kochman, Y., Khina, A., Erez, U., and Zamir, R. (2008, January 6\u201311). Rematch and forward for parallel relay networks. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192008), Toronto, ON, Canada.","DOI":"10.1109\/ISIT.2008.4595090"},{"key":"ref_25","unstructured":"Awan, Z.H., Zaidi, A., and Vandendorpe, L. (2010). Secure communication over parallel relay channel. arXiv."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3806","DOI":"10.1109\/TIT.2007.904782","article-title":"Cooperation in a Half-Duplex Gaussian Diamond Relay Channel","volume":"53","author":"Xue","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kang, W., and Ulukus, S. (2008, January 23\u201326). Capacity of a class of diamond channels. Proceedings of the Allerton Conference on Communication, Control and Computing, Urbana-Champaign, IL, USA.","DOI":"10.1109\/ALLERTON.2008.4797730"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"7708","DOI":"10.1109\/TIT.2014.2360843","article-title":"Achieving the Capacity of the N-Relay Gaussian Diamond Network Within logN Bits","volume":"60","author":"Chern","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Sigurj\u00f3nsson, S., and Kim, Y.H. (2005, January 4\u20139). On multiple user channels with state information at the transmitters. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192005), Adelaide, Australia.","DOI":"10.1109\/ISIT.2005.1523295"},{"key":"ref_30","unstructured":"Simeone, O., G\u00fcnd\u00fcz, D., and Shamai, S. (October, January 30). Compound relay channel with informed relay and destination. Proceedings of the Allerton Conference on Communication, Control and Computing, Monticello, IL, USA."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2009\/634296","article-title":"Lower bounds on the capacity of the relay channel with states at the source","volume":"2009","author":"Zaidi","year":"2009","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1109\/TIT.2010.2043782","article-title":"Cooperative Relaying With State Available Noncausally at the Relay","volume":"56","author":"Zaidi","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2639","DOI":"10.1109\/TIT.2012.2229780","article-title":"Bounds on the capacity of the relay channel with noncausal state at the source","volume":"59","author":"Zaidi","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1214\/aoms\/1177705783","article-title":"The capacities of certain channel classes under random coding","volume":"31","author":"Blackwell","year":"1960","journal-title":"Ann. Math. Stat."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Simon, M.K., and Alouini, M.S. (2005). Digital Communication over Fading Channels, John Wiley & Sons.","DOI":"10.1002\/0471715220"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"2617","DOI":"10.1109\/TIT.2003.817834","article-title":"A broadcast approach for a single-user slowly fading MIMO channel","volume":"49","author":"Shamai","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"718","DOI":"10.4218\/etrij.17.0117.0246","article-title":"Novel Approach for Modeling Wireless Fading Channels Using a Finite State Markov Chain","volume":"39","author":"Sheriff","year":"2017","journal-title":"ETRI J."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/25.293655","article-title":"Information theoretic considerations for cellular mobile radio","volume":"43","author":"Ozarow","year":"1994","journal-title":"IEEE Trans. Veh. Tech."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1986","DOI":"10.1109\/18.641562","article-title":"Capacity of fading channels with channel side information","volume":"43","author":"Goldsmith","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"2007","DOI":"10.1109\/18.782125","article-title":"On the capacity of some channels with channel state information","volume":"45","author":"Caire","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/MCOM.2003.1186553","article-title":"Distributed wireless communication system: A new architecture for future public wireless access","volume":"41","author":"Zhou","year":"2003","journal-title":"IEEE Commun. Mag."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TCYB.2016.2635122","article-title":"Finite-time distributed state estimation over sensor networks with round-robin protocol and fading channels","volume":"48","author":"Xu","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"ref_43","first-page":"52","article-title":"Coding in a memory with defective cells","volume":"10","author":"Kuznetsov","year":"1974","journal-title":"Probl. Peredachi Inf."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TIT.1983.1056723","article-title":"On the capacity of computer memory with defects","volume":"29","author":"Heegard","year":"1983","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1109\/18.340461","article-title":"On the general defective channel with informed encoder and capacities of some constrained memories","volume":"40","author":"Kuzntsov","year":"1994","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_46","unstructured":"Kim, Y., and Kumar, B.V.K.V. (October, January 30). Writing on dirty flash memory. Proceedings of the Allerton Conference on Communication, Control and Computing, Monticello, IL, USA."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Bunin, A., Goldfeld, Z., Permuter, H.H., Shamai, S., Cuff, P., and Piantanida, P. (2018). Key and message semantic-security over state-dependent channels. IEEE Trans. Inf. Forensic Secur.","DOI":"10.1109\/ISIT.2018.8437854"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Gungor, O., Koksal, C.E., and Gamal, H.E. (2013, January 3\u20136). An information theoretic approach to RF fingerprinting. Proceedings of the Asilomar Conference on Signals, Systems and Computers (ACSSC\u20192013), Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2013.6810230"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1561\/0100000051","article-title":"Biometric security from an information-theoretical perspective","volume":"7","author":"Ignatenko","year":"2012","journal-title":"Found. Trends\u00ae Commun. Inf. Theory"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Han, G., Xiao, L., and Poor, H.V. (2017, January 5\u20139). Two-dimensional anti-jamming communication based on deep reinforcement learning. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), New Orleans, LA, USA.","DOI":"10.1109\/ICASSP.2017.7952524"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Xu, W., Trappe, W., Zhang, Y., and Wood, T. (2005, January 25\u201327). The feasibility of launching and detecting jamming attacks in wireless networks. Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing, Urbana-Champaign, IL, USA.","DOI":"10.1145\/1062689.1062697"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Alnifie, G., and Simon, R. (2007, January 22). A multi-channel defense against jamming attacks in wireless sensor networks. Proceedings of the ACM Workshop on QoS Security Wireless Mobile Networks, Crete Island, Greece.","DOI":"10.1145\/1298239.1298257"},{"key":"ref_53","unstructured":"Padmavathi, G., and Shanmugapriya, D. (2009). A survey of attacks, security mechanisms and challenges in wireless sensor networks. arXiv."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Wang, T., Liang, T., Wei, X., and Fan, J. (2018, January 26\u201327). Localization of Directional Jammer in Wireless Sensor Networks. Proceedings of the 2018 International Conference on Robots & Intelligent System (ICRIS) (ICRIS\u20192018), Changsha, China.","DOI":"10.1109\/ICRIS.2018.00059"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00533053","article-title":"Elimination of correlation in random codes for arbitrarily varying channels","volume":"44","author":"Ahlswede","year":"1978","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Gebiete"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TIT.1985.1056995","article-title":"Exponential error bounds for random codes in the arbitrarily varying channel","volume":"31","author":"Ericson","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/18.2627","article-title":"The capacity of the arbitrarily varying channel revisited: Positivity, constraints","volume":"34","author":"Narayan","year":"1988","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_58","first-page":"220","article-title":"Coloring hypergraphs: A new approach to multi-user source coding, Part 2","volume":"5","author":"Ahlswede","year":"1980","journal-title":"J. Comb."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TIT.1986.1057222","article-title":"Arbitrarily varying channels with states sequence known to the sender","volume":"32","author":"Ahlswede","year":"1986","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/TIT.1981.1056320","article-title":"Coding of arbitrarily varying multiuser channels","volume":"27","author":"Jahn","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"5023","DOI":"10.1109\/TIT.2006.883543","article-title":"On the deterministic-code capacity of the two-user discrete memoryless Arbitrarily Varying General Broadcast channel with degraded message sets","volume":"52","author":"Hof","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Winshtok, A., and Steinberg, Y. (2006, January 9\u201314). The arbitrarily varying degraded broadcast channel with states known at the encoder. Proceedings of the 2006 IEEE International Symposium on Information Theory, Seattle, WA, USA.","DOI":"10.1109\/ISIT.2006.261932"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"4733","DOI":"10.1109\/TIT.2013.2256952","article-title":"MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom","volume":"59","author":"He","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_64","unstructured":"Pereg, U., and Steinberg, Y. (2018, January 25\u201330). The arbitrarily varying degraded broadcast channel with causal side information at the encoder. Proceedings of the 2018 International Zurich Seminar Information Communication (IZS\u20192018), Aachen, Germany."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Keresztfalvi, T., and Lapidoth, A. (2018, January 17\u201322). Partially-robust communications over a noisy channel. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192018), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437765"},{"key":"ref_66","unstructured":"Gubner, J.A. (1988). Deterministic Codes for Arbitrarily Varying Multiple-Access Channels. [Ph.D. Dissertation, University of Maryland]."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/18.52472","article-title":"On the deterministic-code capacity of the multiple-access arbitrarily varying channel","volume":"36","author":"Gubner","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/18.61126","article-title":"State constraints for the multiple-access arbitrarily varying channel","volume":"37","author":"Gubner","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/18.144713","article-title":"On the capacity region of the discrete additive multiple-access arbitrarily varying channel","volume":"38","author":"Gubner","year":"1992","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/18.370123","article-title":"Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints","volume":"41","author":"Gubner","year":"1995","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_71","unstructured":"Ahlswede, R., and Cai, N. (1996). Arbitrarily Varying Multiple-Access Channels, Universit\u00e4t Bielefeld."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/18.749024","article-title":"Arbitrarily varying multiple-access channels. I. Ericson\u2019s symmetrizability is adequate, Gubner\u2019s conjecture is true","volume":"45","author":"Ahlswede","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"He, X., Khisti, A., and Yener, A. (2011, January 28\u201330). MIMO multiple access channel with an arbitrarily varying eavesdropper. Proceedings of the Allerton Conference on Communication, Control and Computing (Allerton\u20192011), Monticello, IL, USA.","DOI":"10.1109\/Allerton.2011.6120301"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1109\/TIT.2012.2229779","article-title":"The arbitrarily varying multiple-access channel with conferencing encoders","volume":"59","author":"Wiese","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_75","doi-asserted-by":"crossref","first-page":"2683","DOI":"10.1109\/TIT.2013.2242514","article-title":"On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding","volume":"59","author":"Nitinawarat","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_76","unstructured":"MolavianJazi, E., Bloch, M., and Laneman, J.N. (October, January 30). Arbitrary jamming can preclude secure communication. Proceedings of the Allerton Conference on Communication, Control and Computing, Monticello, IL, USA."},{"key":"ref_77","first-page":"1482","article-title":"Capacity results and super-activation for wiretap channels with active wiretappers","volume":"8","author":"Boche","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Aydinian, H., Cicalese, F., and Deppe, C. (2013). Information Theory, Combinatorics, and Search Theory, Springer. Chapter 5.","DOI":"10.1007\/978-3-642-36899-8"},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Boche, H., Schaefer, R.F., and Poor, H.V. (July, January 29). On arbitrarily varying wiretap channels for different classes of secrecy measures. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192014), Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875259"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1109\/TIFS.2015.2465937","article-title":"On the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels","volume":"10","author":"Boche","year":"2015","journal-title":"IEEE Trans. Inf. Forensic Secur."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"3504","DOI":"10.1109\/TIT.2016.2550587","article-title":"The arbitrarily varying wiretap channel\u2014Secret randomness, stability, and super-activation","volume":"62","author":"Wiese","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"7216","DOI":"10.1109\/TIT.2016.2619701","article-title":"Arbitrarily Varying Wiretap Channels with Type Constrained States","volume":"62","author":"Goldfeld","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_83","unstructured":"He, D., and Luo, Y. (2017). Arbitrarily varying wiretap channel with state sequence known or unknown at the receiver. arXiv."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1109\/TIFS.2018.2797004","article-title":"Secure identification for wiretap channels; Robustness, super-additivity and continuity","volume":"13","author":"Boche","year":"2018","journal-title":"IEEE Trans. Inf. Forensic Secur."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TIT.2018.2861776","article-title":"The Arbitrarily Varying Channel Under Constraints with Side Information at the Encoder","volume":"65","author":"Pereg","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_86","doi-asserted-by":"crossref","unstructured":"Pereg, U., and Steinberg, Y. (2017, January 25\u201330). The arbitrarily varying channel under constraints with causal side information at the encoder. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192017), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8007041"},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/18.61125","article-title":"Capacity of the Gaussian arbitrarily varying channel","volume":"37","author":"Narayan","year":"1991","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_88","doi-asserted-by":"crossref","unstructured":"Behboodi, A., and Piantanida, P. (July, January 28). On the simultaneous relay channel with informed receivers. Proceedings of the IEEE International Symposium on Information Theory (ISIT\u20192009), Seoul, Korea.","DOI":"10.1109\/ISIT.2009.5205996"},{"key":"ref_89","doi-asserted-by":"crossref","unstructured":"Bjelakovi\u0107, I., Boche, H., and Sommerfeld, J. (2013). Capacity results for arbitrarily varying wiretap channels. Information Theory, Combinatorics, and Search Theory, Springer.","DOI":"10.1007\/978-3-642-36899-8_5"},{"key":"ref_90","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","article-title":"On General Minimax Theorems","volume":"8","author":"Sion","year":"1958","journal-title":"Pac. J. Math."},{"key":"ref_91","doi-asserted-by":"crossref","unstructured":"Pereg, U., and Steinberg, Y. (2018). The arbitrarily varying gaussian relay channel with sender frequency division. arXiv.","DOI":"10.1109\/ISIT.2018.8437527"},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TIT.1987.1057288","article-title":"Gaussian arbitrarily varying channels","volume":"33","author":"Hughes","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_93","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (2011). Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511921889"},{"key":"ref_94","doi-asserted-by":"crossref","unstructured":"Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"ref_95","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1214\/aoms\/1177706106","article-title":"The capacity of a class of channels","volume":"30","author":"Blackwell","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1109\/18.959289","article-title":"The worst additive noise under a covariance constraint","volume":"47","author":"Diggavi","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_97","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_98","doi-asserted-by":"crossref","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley. [2nd ed.].","DOI":"10.1002\/047174882X"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/5\/516\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:54:20Z","timestamp":1760187260000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/5\/516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,22]]},"references-count":98,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2019,5]]}},"alternative-id":["e21050516"],"URL":"https:\/\/doi.org\/10.3390\/e21050516","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,22]]}}}