Improved upper bounds on the capacity of binary channels with causal adversaries

Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate

نتاج البحث: فصل من :كتاب / تقرير / مؤتمرمنشور من مؤتمرمراجعة النظراء

ملخص

In this work we consider the communication of information in the presence of a causal adversarial jammer. In the setting under study, a sender wishes to communicate a message to a receiver by transmitting a codeword x = (x 1, ..., xn) bit-by-bit over a communication channel. The adversarial jammer can view the transmitted bits xi one at a time, and can change up to a p-fraction of them. However, the decisions of the jammer must be made in a causal manner. Namely, for each bit xi the jammer's decision on whether to corrupt it or not must depend only on xj for j ≤ i. This is in contrast to the "classical" adversarial jammer which may base its decisions on its complete knowledge of x. Binary channels with causal adversarial jammers have seen recent studies in which both lower bounds and upper bounds on their capacity is derived. In this work, we present improved upper bounds on the capacity which hold for both deterministic and stochastic encoding schemes.

اللغة الأصليةالإنجليزيّة
عنوان منشور المضيف2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
الصفحات681-685
عدد الصفحات5
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2012
الحدث2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, الولايات المتّحدة
المدة: ١ يوليو ٢٠١٢٦ يوليو ٢٠١٢

سلسلة المنشورات

الاسمIEEE International Symposium on Information Theory - Proceedings
رقم المعيار الدولي للدوريات (المطبوع)2157-8105

!!Conference

!!Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
الدولة/الإقليمالولايات المتّحدة
المدينةCambridge, MA
المدة١/٠٧/١٢٦/٠٧/١٢

بصمة

أدرس بدقة موضوعات البحث “Improved upper bounds on the capacity of binary channels with causal adversaries'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا