activity
20122023
most citedMinimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an AVC

1 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing 2012Show all

2 papers · 1 filter

cs.IT2012★ 1 cited

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…

cs.IT2012

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…