1 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
Achievable Rates for Information Extraction from a Strategic Sender
Anuj S. Vora, Ankur A. Kulkarni
We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender…
Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC
Anuj S. Vora, Ankur A. Kulkarni
Motivated by applications in the security of cyber-physical systems, we pose the finite blocklength communication problem in the presence of a jammer as a zero-sum game between the…
Improved Finite Blocklength Converses for Slepian-Wolf Coding via Linear Programming
Sharu Theresa Jose, Ankur A. Kulkarni
A new finite blocklength converse for the Slepian- Wolf coding problem is presented which significantly improves on the best known converse for this problem, due to Miyake and Kana…
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An -bit -deletion correcting code is an independent…
Non-asymptotic Upper Bounds for Deletion Correcting Codes
Ankur A. Kulkarni, Negar Kiyavash
Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for -ary alphab…