[{"scopus_import":"1","external_id":{"arxiv":["2205.06708"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-09-05T09:09:15Z","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"oa_version":"Preprint","year":"2022","volume":2022,"publication_status":"published","oa":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2205.06708","open_access":"1"}],"date_published":"2022-08-03T00:00:00Z","_id":"12011","abstract":[{"lang":"eng","text":"We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost constraints, (c) the transition matrix of the channel is deterministic given the state, and (d) at each time step the adversary can only observe the current and past channel inputs when choosing the state at that time. The achievable strategy involves stochastic encoding together with list decoding and a disambiguation step. The converse uses a two-phase \"babble-and-push\" strategy where the adversary chooses the state randomly in the first phase, list decodes the output, and then chooses state inputs to symmetrize the channel in the second phase. These results generalize prior work on specific channels models (additive, erasure) to general discrete alphabets and models."}],"arxiv":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1109/ISIT50566.2022.9834709","acknowledgement":"The work of ADS and ML was supported in part by the US National Science Foundation under awards CCF-1909468 and CCF-1909451.","day":"03","type":"conference","author":[{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","first_name":"Yihan","full_name":"Zhang, Yihan","last_name":"Zhang"},{"last_name":"Jaggi","first_name":"Sidharth","full_name":"Jaggi, Sidharth"},{"last_name":"Langberg","first_name":"Michael","full_name":"Langberg, Michael"},{"last_name":"Sarwate","first_name":"Anand D.","full_name":"Sarwate, Anand D."}],"citation":{"chicago":"Zhang, Yihan, Sidharth Jaggi, Michael Langberg, and Anand D. Sarwate. “The Capacity of Causal Adversarial Channels.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2523–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>.","ieee":"Y. Zhang, S. Jaggi, M. Langberg, and A. D. Sarwate, “The capacity of causal adversarial channels,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2523–2528.","ista":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. 2022. The capacity of causal adversarial channels. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2523–2528.","mla":"Zhang, Yihan, et al. “The Capacity of Causal Adversarial Channels.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2523–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>.","short":"Y. Zhang, S. Jaggi, M. Langberg, A.D. Sarwate, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2523–2528.","ama":"Zhang Y, Jaggi S, Langberg M, Sarwate AD. The capacity of causal adversarial channels. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2523-2528. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">10.1109/ISIT50566.2022.9834709</a>","apa":"Zhang, Y., Jaggi, S., Langberg, M., &#38; Sarwate, A. D. (2022). The capacity of causal adversarial channels. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2523–2528). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834709\">https://doi.org/10.1109/ISIT50566.2022.9834709</a>"},"title":"The capacity of causal adversarial channels","conference":{"location":"Espoo, Finland","name":"ISIT: Internation Symposium on Information Theory","start_date":"2022-06-26","end_date":"2022-07-01"},"publication":"2022 IEEE International Symposium on Information Theory","quality_controlled":"1","department":[{"_id":"MaMo"}],"intvolume":"      2022","status":"public","publisher":"IEEE","month":"08","date_created":"2022-09-04T22:02:03Z","page":"2523-2528"},{"title":"Heterogeneous differential privacy via graphs","conference":{"location":"Espoo, Finland","start_date":"2022-06-26","end_date":"2022-07-01","name":"ISIT: Internation Symposium on Information Theory"},"citation":{"ama":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. Heterogeneous differential privacy via graphs. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:1623-1628. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>","apa":"Torkamani, S., Ebrahimi, J. B., Sadeghi, P., D’Oliveira, R. G. L., &#38; Médard, M. (2022). Heterogeneous differential privacy via graphs. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 1623–1628). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>","short":"S. Torkamani, J.B. Ebrahimi, P. Sadeghi, R.G.L. D’Oliveira, M. Médard, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 1623–1628.","mla":"Torkamani, Sahel, et al. “Heterogeneous Differential Privacy via Graphs.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 1623–28, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">10.1109/ISIT50566.2022.9834711</a>.","chicago":"Torkamani, Sahel, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G.L. D’Oliveira, and Muriel Médard. “Heterogeneous Differential Privacy via Graphs.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:1623–28. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834711\">https://doi.org/10.1109/ISIT50566.2022.9834711</a>.","ista":"Torkamani S, Ebrahimi JB, Sadeghi P, D’Oliveira RGL, Médard M. 2022. Heterogeneous differential privacy via graphs. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1623–1628.","ieee":"S. Torkamani, J. B. Ebrahimi, P. Sadeghi, R. G. L. D’Oliveira, and M. Médard, “Heterogeneous differential privacy via graphs,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 1623–1628."},"author":[{"full_name":"Torkamani, Sahel","first_name":"Sahel","last_name":"Torkamani","id":"0503e7f8-2d05-11ed-aa17-db0640c720fc"},{"full_name":"Ebrahimi, Javad B.","first_name":"Javad B.","last_name":"Ebrahimi"},{"last_name":"Sadeghi","full_name":"Sadeghi, Parastoo","first_name":"Parastoo"},{"full_name":"D'Oliveira, Rafael G.L.","first_name":"Rafael G.L.","last_name":"D'Oliveira"},{"full_name":"Médard, Muriel","first_name":"Muriel","last_name":"Médard"}],"type":"conference","day":"03","doi":"10.1109/ISIT50566.2022.9834711","language":[{"iso":"eng"}],"page":"1623-1628","date_created":"2022-09-04T22:02:04Z","month":"08","publisher":"IEEE","intvolume":"      2022","status":"public","publication":"2022 IEEE International Symposium on Information Theory","department":[{"_id":"MaMo"}],"quality_controlled":"1","year":"2022","oa_version":"Preprint","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"scopus_import":"1","external_id":{"arxiv":["2203.15429"]},"date_updated":"2022-09-05T10:28:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","arxiv":1,"_id":"12012","date_published":"2022-08-03T00:00:00Z","abstract":[{"text":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. We generalize a previous framework for designing utility-optimal differentially private (DP) mechanisms via graphs, where datasets are vertices in the graph and edges represent dataset neighborhood. The boundary set contains datasets where an individual’s response changes the binary-valued query compared to its neighbors. Previous work was limited to the homogeneous case where the privacy parameter ε across all datasets was the same and the mechanism at boundary datasets was identical. In our work, the mechanism can take different distributions at the boundary and the privacy parameter ε is a function of neighboring datasets, which recovers an earlier definition of personalized DP as special case. The problem is how to extend the mechanism, which is only defined at the boundary set, to other datasets in the graph in a computationally efficient and utility optimal manner. Using the concept of strongest induced DP condition we solve this problem efficiently in polynomial time (in the size of the graph).","lang":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2203.15429"}],"publication_status":"published","volume":2022},{"doi":"10.1109/ISIT50566.2022.9834850","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"date_updated":"2022-09-05T10:23:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"None","year":"2022","type":"conference","author":[{"first_name":"Pranav","full_name":"Joshi, Pranav","last_name":"Joshi"},{"last_name":"Purkayastha","first_name":"Amritakshya","full_name":"Purkayastha, Amritakshya"},{"full_name":"Zhang, Yihan","first_name":"Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"last_name":"Budkuley","full_name":"Budkuley, Amitalok J.","first_name":"Amitalok J."},{"last_name":"Jaggi","full_name":"Jaggi, Sidharth","first_name":"Sidharth"}],"day":"03","conference":{"name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","start_date":"2022-06-26","location":"Espoo, Finland"},"title":"On the capacity of additive AVCs with feedback","citation":{"chicago":"Joshi, Pranav, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “On the Capacity of Additive AVCs with Feedback.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:504–9. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">https://doi.org/10.1109/ISIT50566.2022.9834850</a>.","ieee":"P. Joshi, A. Purkayastha, Y. Zhang, A. J. Budkuley, and S. Jaggi, “On the capacity of additive AVCs with feedback,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 504–509.","ista":"Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. 2022. On the capacity of additive AVCs with feedback. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 504–509.","mla":"Joshi, Pranav, et al. “On the Capacity of Additive AVCs with Feedback.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 504–09, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">10.1109/ISIT50566.2022.9834850</a>.","short":"P. Joshi, A. Purkayastha, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 504–509.","ama":"Joshi P, Purkayastha A, Zhang Y, Budkuley AJ, Jaggi S. On the capacity of additive AVCs with feedback. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:504-509. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">10.1109/ISIT50566.2022.9834850</a>","apa":"Joshi, P., Purkayastha, A., Zhang, Y., Budkuley, A. J., &#38; Jaggi, S. (2022). On the capacity of additive AVCs with feedback. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 504–509). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834850\">https://doi.org/10.1109/ISIT50566.2022.9834850</a>"},"volume":2022,"intvolume":"      2022","status":"public","quality_controlled":"1","department":[{"_id":"MaMo"}],"publication":"2022 IEEE International Symposium on Information Theory","publisher":"IEEE","publication_status":"published","_id":"12013","date_published":"2022-08-03T00:00:00Z","date_created":"2022-09-04T22:02:04Z","abstract":[{"lang":"eng","text":"We consider the problem of communication over adversarial channels with feedback. Two parties comprising sender Alice and receiver Bob seek to communicate reliably. An adversary James observes Alice's channel transmission entirely and chooses, maliciously, its additive channel input or jamming state thereby corrupting Bob's observation. Bob can communicate over a one-way reverse link with Alice; we assume that transmissions over this feedback link cannot be corrupted by James. Our goal in this work is to study the optimum throughput or capacity over such channels with feedback. We first present results for the quadratically-constrained additive channel where communication is known to be impossible when the noise-to-signal (power) ratio (NSR) is at least 1. We present a novel achievability scheme to establish that positive rate communication is possible even when the NSR is as high as 8/9. We also present new converse upper bounds on the capacity of this channel under potentially stochastic encoders and decoders. We also study feedback communication over the more widely studied q-ary alphabet channel under additive noise. For the q -ary channel, where q > 2, it is well known that capacity is positive under full feedback if and only if the adversary can corrupt strictly less than half the transmitted symbols. We generalize this result and show that the same threshold holds for positive rate communication when the noiseless feedback may only be partial; our scheme employs a stochastic decoder. We extend this characterization, albeit partially, to fully deterministic schemes under partial noiseless feedback. We also present new converse upper bounds for q-ary channels under full feedback, where the encoder and/or decoder may privately randomize. Our converse results bring to the fore an interesting alternate expression for the well known converse bound for the q—ary channel under full feedback which, when specialized to the binary channel, also equals its known capacity."}],"month":"08","article_processing_charge":"No","page":"504-509"},{"type":"conference","author":[{"last_name":"Zhang","first_name":"Yihan","full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"last_name":"Vatedka","first_name":"Shashank","full_name":"Vatedka, Shashank"}],"oa_version":"None","year":"2022","day":"03","title":"List-decodability of Poisson Point Processes","conference":{"location":"Espoo, Finland","end_date":"2022-07-01","start_date":"2022-06-26","name":"ISIT: Internation Symposium on Information Theory"},"citation":{"mla":"Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2559–64, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">10.1109/ISIT50566.2022.9834512</a>.","ista":"Zhang Y, Vatedka S. 2022. List-decodability of Poisson Point Processes. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2559–2564.","ieee":"Y. Zhang and S. Vatedka, “List-decodability of Poisson Point Processes,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2559–2564.","chicago":"Zhang, Yihan, and Shashank Vatedka. “List-Decodability of Poisson Point Processes.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2559–64. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">https://doi.org/10.1109/ISIT50566.2022.9834512</a>.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). List-decodability of Poisson Point Processes. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2559–2564). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">https://doi.org/10.1109/ISIT50566.2022.9834512</a>","ama":"Zhang Y, Vatedka S. List-decodability of Poisson Point Processes. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2559-2564. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834512\">10.1109/ISIT50566.2022.9834512</a>","short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2559–2564."},"publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"doi":"10.1109/ISIT50566.2022.9834512","scopus_import":"1","language":[{"iso":"eng"}],"date_updated":"2022-09-05T09:23:04Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12014","date_created":"2022-09-04T22:02:04Z","date_published":"2022-08-03T00:00:00Z","abstract":[{"lang":"eng","text":"We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let N > 0 and L∈Z≥2. A multiple packing is a set C of points in Rn such that any point in Rn lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. Given a well-known connection with coding theory, multiple packings can be viewed as the Euclidean analog of list-decodable codes, which are well-studied for finite fields. In this paper, we exactly pin down the asymptotic density of (expurgated) Poisson Point Processes under a stronger notion called average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. This gives rise to the best known lower bound on the largest multiple packing density. Our result corrects a mistake in a previous paper by Blinovsky [Bli05]."}],"month":"08","article_processing_charge":"No","page":"2559-2564","intvolume":"      2022","status":"public","volume":2022,"publication":"2022 IEEE International Symposium on Information Theory","quality_controlled":"1","department":[{"_id":"MaMo"}],"publication_status":"published","publisher":"IEEE"},{"doi":"10.1109/ISIT50566.2022.9834443","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"language":[{"iso":"eng"}],"date_updated":"2022-09-05T10:39:04Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"None","year":"2022","author":[{"last_name":"Zhang","full_name":"Zhang, Yihan","first_name":"Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"last_name":"Vatedka","full_name":"Vatedka, Shashank","first_name":"Shashank"}],"type":"conference","day":"03","conference":{"location":"Espoo, Finland","end_date":"2022-07-01","start_date":"2022-06-26","name":"ISIT: Internation Symposium on Information Theory"},"title":"Lower bounds for multiple packing","citation":{"short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 3085–3090.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). Lower bounds for multiple packing. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 3085–3090). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">https://doi.org/10.1109/ISIT50566.2022.9834443</a>","ama":"Zhang Y, Vatedka S. Lower bounds for multiple packing. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:3085-3090. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">10.1109/ISIT50566.2022.9834443</a>","ieee":"Y. Zhang and S. Vatedka, “Lower bounds for multiple packing,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 3085–3090.","ista":"Zhang Y, Vatedka S. 2022. Lower bounds for multiple packing. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 3085–3090.","chicago":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:3085–90. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">https://doi.org/10.1109/ISIT50566.2022.9834443</a>.","mla":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds for Multiple Packing.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 3085–90, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834443\">10.1109/ISIT50566.2022.9834443</a>."},"volume":2022,"status":"public","intvolume":"      2022","quality_controlled":"1","department":[{"_id":"MaMo"}],"publication":"2022 IEEE International Symposium on Information Theory","publisher":"IEEE","publication_status":"published","_id":"12015","date_created":"2022-09-04T22:02:05Z","abstract":[{"lang":"eng","text":"We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two lower bounds on the largest possible density of a multiple packing. These bounds are obtained through a stronger notion called average-radius multiple packing. Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes and (expurgated) spherical codes under average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. The bound for spherical codes matches the previous best known bound which was obtained for the standard (weaker) notion of multiple packing through a curious connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes suggests that they are strictly inferior to spherical codes."}],"date_published":"2022-08-03T00:00:00Z","month":"08","article_processing_charge":"No","page":"3085-3090"},{"page":"2154-2159","date_created":"2022-09-04T22:02:05Z","month":"08","publisher":"IEEE","status":"public","intvolume":"      2022","quality_controlled":"1","department":[{"_id":"MaMo"}],"publication":"2022 IEEE International Symposium on Information Theory","conference":{"end_date":"2022-07-01","start_date":"2022-06-26","name":"ISIT: Internation Symposium on Information Theory","location":"Espoo, Finland"},"title":"Polar coded computing: The role of the scaling exponent","citation":{"mla":"Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, IEEE, 2022, pp. 2154–59, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">10.1109/ISIT50566.2022.9834712</a>.","chicago":"Fathollahi, Dorsa, and Marco Mondelli. “Polar Coded Computing: The Role of the Scaling Exponent.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2154–59. IEEE, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">https://doi.org/10.1109/ISIT50566.2022.9834712</a>.","ista":"Fathollahi D, Mondelli M. 2022. Polar coded computing: The role of the scaling exponent. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2154–2159.","ieee":"D. Fathollahi and M. Mondelli, “Polar coded computing: The role of the scaling exponent,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2154–2159.","ama":"Fathollahi D, Mondelli M. Polar coded computing: The role of the scaling exponent. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. IEEE; 2022:2154-2159. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">10.1109/ISIT50566.2022.9834712</a>","apa":"Fathollahi, D., &#38; Mondelli, M. (2022). Polar coded computing: The role of the scaling exponent. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2154–2159). Espoo, Finland: IEEE. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834712\">https://doi.org/10.1109/ISIT50566.2022.9834712</a>","short":"D. Fathollahi, M. Mondelli, in:, 2022 IEEE International Symposium on Information Theory, IEEE, 2022, pp. 2154–2159."},"author":[{"first_name":"Dorsa","full_name":"Fathollahi, Dorsa","last_name":"Fathollahi"},{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"type":"conference","day":"03","acknowledgement":"D. Fathollahi and M. Mondelli were partially supported by the 2019 Lopez-Loreta Prize. The authors thank Hamed Hassani and Hessam Mahdavifar for helpful discussions.","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"doi":"10.1109/ISIT50566.2022.9834712","language":[{"iso":"eng"}],"article_processing_charge":"No","arxiv":1,"_id":"12016","date_published":"2022-08-03T00:00:00Z","abstract":[{"text":"We consider the problem of coded distributed computing using polar codes. The average execution time of a coded computing system is related to the error probability for transmission over the binary erasure channel in recent work by Soleymani, Jamali and Mahdavifar, where the performance of binary linear codes is investigated. In this paper, we focus on polar codes and unveil a connection between the average execution time and the scaling exponent μ of the family of codes. In the finite-length characterization of polar codes, the scaling exponent is a key object capturing the speed of convergence to capacity. In particular, we show that (i) the gap between the normalized average execution time of polar codes and that of optimal MDS codes is O(n –1/μ ), and (ii) this upper bound can be improved to roughly O(n –1/2 ) by considering polar codes with large kernels. We conjecture that these bounds could be improved to O(n –2/μ ) and O(n –1 ), respectively, and provide a heuristic argument as well as numerical evidence supporting this view.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2201.10082","open_access":"1"}],"oa":1,"publication_status":"published","volume":2022,"year":"2022","oa_version":"Preprint","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"date_updated":"2024-09-10T13:03:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2201.10082"]},"scopus_import":"1"},{"article_processing_charge":"No","page":"2535-2540","_id":"12017","abstract":[{"text":"In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget.","lang":"eng"}],"date_created":"2022-09-04T22:02:06Z","date_published":"2022-08-03T00:00:00Z","month":"08","publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","intvolume":"      2022","status":"public","volume":2022,"publication":"2022 IEEE International Symposium on Information Theory","department":[{"_id":"MaMo"}],"quality_controlled":"1","title":"New results on AVCs with omniscient and myopic adversaries","conference":{"location":"Espoo, Finland","end_date":"2022-07-01","start_date":"2022-06-26","name":"ISIT: Internation Symposium on Information Theory"},"citation":{"chicago":"Yadav, Anuj Kumar, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, and Sidharth Jaggi. “New Results on AVCs with Omniscient and Myopic Adversaries.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2535–40. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">https://doi.org/10.1109/ISIT50566.2022.9834632</a>.","ista":"Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. 2022. New results on AVCs with omniscient and myopic adversaries. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2535–2540.","ieee":"A. K. Yadav, M. Alimohammadi, Y. Zhang, A. J. Budkuley, and S. Jaggi, “New results on AVCs with omniscient and myopic adversaries,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2535–2540.","mla":"Yadav, Anuj Kumar, et al. “New Results on AVCs with Omniscient and Myopic Adversaries.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–40, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">10.1109/ISIT50566.2022.9834632</a>.","short":"A.K. Yadav, M. Alimohammadi, Y. Zhang, A.J. Budkuley, S. Jaggi, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2535–2540.","ama":"Yadav AK, Alimohammadi M, Zhang Y, Budkuley AJ, Jaggi S. New results on AVCs with omniscient and myopic adversaries. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2535-2540. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">10.1109/ISIT50566.2022.9834632</a>","apa":"Yadav, A. K., Alimohammadi, M., Zhang, Y., Budkuley, A. J., &#38; Jaggi, S. (2022). New results on AVCs with omniscient and myopic adversaries. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2535–2540). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834632\">https://doi.org/10.1109/ISIT50566.2022.9834632</a>"},"author":[{"last_name":"Yadav","full_name":"Yadav, Anuj Kumar","first_name":"Anuj Kumar"},{"last_name":"Alimohammadi","first_name":"Mohammadreza","full_name":"Alimohammadi, Mohammadreza"},{"last_name":"Zhang","first_name":"Yihan","full_name":"Zhang, Yihan","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"full_name":"Budkuley, Amitalok J.","first_name":"Amitalok J.","last_name":"Budkuley"},{"full_name":"Jaggi, Sidharth","first_name":"Sidharth","last_name":"Jaggi"}],"type":"conference","year":"2022","oa_version":"None","day":"03","publication_identifier":{"isbn":["9781665421591"],"issn":["2157-8095"]},"doi":"10.1109/ISIT50566.2022.9834632","scopus_import":"1","language":[{"iso":"eng"}],"date_updated":"2023-02-13T09:00:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":"1","language":[{"iso":"eng"}],"date_updated":"2023-02-13T09:02:06Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"doi":"10.1109/ISIT50566.2022.9834815","day":"03","type":"conference","author":[{"first_name":"Yihan","full_name":"Zhang, Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"},{"last_name":"Vatedka","first_name":"Shashank","full_name":"Vatedka, Shashank"}],"oa_version":"None","year":"2022","citation":{"ista":"Zhang Y, Vatedka S. 2022. Lower bounds on list decoding capacity using error exponents. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 1324–1329.","ieee":"Y. Zhang and S. Vatedka, “Lower bounds on list decoding capacity using error exponents,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 1324–1329.","chicago":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:1324–29. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">https://doi.org/10.1109/ISIT50566.2022.9834815</a>.","mla":"Zhang, Yihan, and Shashank Vatedka. “Lower Bounds on List Decoding Capacity Using Error Exponents.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–29, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">10.1109/ISIT50566.2022.9834815</a>.","short":"Y. Zhang, S. Vatedka, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 1324–1329.","apa":"Zhang, Y., &#38; Vatedka, S. (2022). Lower bounds on list decoding capacity using error exponents. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 1324–1329). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">https://doi.org/10.1109/ISIT50566.2022.9834815</a>","ama":"Zhang Y, Vatedka S. Lower bounds on list decoding capacity using error exponents. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:1324-1329. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834815\">10.1109/ISIT50566.2022.9834815</a>"},"title":"Lower bounds on list decoding capacity using error exponents","conference":{"location":"Espoo, Finland","name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","start_date":"2022-06-26"},"publication":"2022 IEEE International Symposium on Information Theory","department":[{"_id":"MaMo"}],"quality_controlled":"1","intvolume":"      2022","status":"public","volume":2022,"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","month":"08","_id":"12018","abstract":[{"lang":"eng","text":"We study the problem of characterizing the maximal rates of list decoding in Euclidean spaces for finite list sizes. For any positive integer L ≥ 2 and real N > 0, we say that a subset C⊂Rn is an (N,L – 1)-multiple packing or an (N,L– 1)-list decodable code if every Euclidean ball of radius nN−−−√ in ℝ n contains no more than L − 1 points of C. We study this problem with and without ℓ 2 norm constraints on C, and derive the best-known lower bounds on the maximal rate for (N,L−1) multiple packing. Our bounds are obtained via error exponents for list decoding over Additive White Gaussian Noise (AWGN) channels. We establish a curious inequality which relates the error exponent, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We derive various bounds on the error exponent for list decoding in both bounded and unbounded settings which could be of independent interest beyond multiple packing."}],"date_created":"2022-09-04T22:02:06Z","date_published":"2022-08-03T00:00:00Z","page":"1324-1329","article_processing_charge":"No"},{"oa_version":"None","year":"2022","type":"conference","author":[{"last_name":"Polyanskii","full_name":"Polyanskii, Nikita","first_name":"Nikita"},{"full_name":"Zhang, Yihan","first_name":"Yihan","last_name":"Zhang","id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c"}],"day":"03","conference":{"location":"Espoo, Finland","name":"ISIT: Internation Symposium on Information Theory","end_date":"2022-07-01","start_date":"2022-06-26"},"title":"List-decodable zero-rate codes for the Z-channel","citation":{"short":"N. Polyanskii, Y. Zhang, in:, 2022 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–2558.","apa":"Polyanskii, N., &#38; Zhang, Y. (2022). List-decodable zero-rate codes for the Z-channel. In <i>2022 IEEE International Symposium on Information Theory</i> (Vol. 2022, pp. 2553–2558). Espoo, Finland: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">https://doi.org/10.1109/ISIT50566.2022.9834829</a>","ama":"Polyanskii N, Zhang Y. List-decodable zero-rate codes for the Z-channel. In: <i>2022 IEEE International Symposium on Information Theory</i>. Vol 2022. Institute of Electrical and Electronics Engineers; 2022:2553-2558. doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">10.1109/ISIT50566.2022.9834829</a>","ieee":"N. Polyanskii and Y. Zhang, “List-decodable zero-rate codes for the Z-channel,” in <i>2022 IEEE International Symposium on Information Theory</i>, Espoo, Finland, 2022, vol. 2022, pp. 2553–2558.","ista":"Polyanskii N, Zhang Y. 2022. List-decodable zero-rate codes for the Z-channel. 2022 IEEE International Symposium on Information Theory. ISIT: Internation Symposium on Information Theory vol. 2022, 2553–2558.","chicago":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” In <i>2022 IEEE International Symposium on Information Theory</i>, 2022:2553–58. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">https://doi.org/10.1109/ISIT50566.2022.9834829</a>.","mla":"Polyanskii, Nikita, and Yihan Zhang. “List-Decodable Zero-Rate Codes for the Z-Channel.” <i>2022 IEEE International Symposium on Information Theory</i>, vol. 2022, Institute of Electrical and Electronics Engineers, 2022, pp. 2553–58, doi:<a href=\"https://doi.org/10.1109/ISIT50566.2022.9834829\">10.1109/ISIT50566.2022.9834829</a>."},"doi":"10.1109/ISIT50566.2022.9834829","publication_identifier":{"issn":["2157-8095"],"isbn":["9781665421591"]},"date_updated":"2023-02-13T09:02:18Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"scopus_import":"1","date_published":"2022-08-03T00:00:00Z","_id":"12019","date_created":"2022-09-04T22:02:07Z","abstract":[{"text":"This paper studies combinatorial properties of codes for the Z-channel. A Z-channel with error fraction τ takes as input a length-n binary codeword and injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L − 1)-list-decodable code for the Z-channel with error fraction τ has exponential (in n) size if τ is less than a critical value that we call the Plotkin point and has constant size if τ is larger than the threshold. The (L−1)-list-decoding Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest (L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for any L − 1 ≥ 1.","lang":"eng"}],"month":"08","article_processing_charge":"No","page":"2553-2558","volume":2022,"status":"public","intvolume":"      2022","department":[{"_id":"MaMo"}],"quality_controlled":"1","publication":"2022 IEEE International Symposium on Information Theory","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers"}]