21 citations · 53 across the 23 of their papers we have counts for
25 papers · 1 filter
Compression with Privacy-Preserving Random Access
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka
We show that an i.i.d.\ binary source sequence can be losslessly compressed at any rate above entropy while ensuring that the decoding of any reveals no info…
Feedback Increases the Capacity of Queues with Bounded Service Times
K. R. Sahasranand, Aslan Tchamkerten
In the "Bits Through Queues" paper, it was hypothesized that full feedback always increases the capacity of first-in-first-out queues, except when the service time distribution is…
Local Decoding in Distributed Compression
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten
It was recently shown that the lossless compression of a single source is achievable with a notion of strong locality; any can be decoded from a constant number of comp…
Reconfigurable Adaptive Channel Sensing
Manuj Mukherjee, Aslan Tchamkerten, Chadi Jabbour
Channel sensing consists of probing the channel from time to time to check whether or not it is active - say, because of an incoming message. When communication is sparse with info…
Zero-Error Sum Modulo Two with a Common Observation
Milad Sefidgaran, Aslan Tchamkerten
This paper investigates the classical modulo two sum problem in source coding, but with a common observation: a transmitter observes , the other transmitter observes …
Error-Correction for Sparse Support Recovery Algorithms
Mohammad Mehrabi, Aslan Tchamkerten
Consider the compressed sensing setup where the support of an -sparse -dimensional signal is to be recovered from linear measurements with a given algorithm. Su…
Worst-Case Local Decoding and Update Efficiency for Data Compression
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten
This paper addresses the problem of data compression with local decoding and local update. A compression scheme has worst-case local decoding if any bit of the raw file ca…
Local Decode and Update for Big Data Compression
Shashank Vatedka, Aslan Tchamkerten
This paper investigates data compression that simultaneously allows local decoding and local update. The main result is a universal compression scheme for memoryless sources with t…
Second Order Asymptotics for Communication under Strong Asynchronism
Longguang Li, Aslan Tchamkerten
The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate and decoding delay ---the elapsed time between whe…
Bits through queues with feedback
Laure Aptel, Aslan Tchamkerten
In their paper Anantharam and Verdú showed that feedback does not increase the capacity of a queue when the service time is exponentially distributed. Whether this conclusio…
Capacity-Achieving Input Distribution in Per-Sample Zero-Dispersion Model of Optical Fiber
Jihad Fahs, Aslan Tchamkerten, Mansoor I. Yousefi
The per-sample zero-dispersion channel model of the optical fiber is considered. It is shown that capacity is uniquely achieved by an input probability distribution that has contin…
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently
Venkat Chandar, Aslan Tchamkerten
The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infre…
Lattice Codes for the Binary Deletion Channel
Lin Sok, Patrick Solé, Aslan Tchamkerten
The construction of deletion codes for the Levenshtein metric is reduced to the construction of codes over the integers for the Manhattan metric by run length coding. The latter co…
Distributed Function Computation Over a Rooted Directed Tree
Milad Sefidgaran, Aslan Tchamkerten
This paper establishes the rate region for a class of source coding function computation setups where sources of information are available at the nodes of a tree and where a functi…
Energy and Sampling Constrained Asynchronous Communication
Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire
The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infre…
On Cooperation in Multi-Terminal Computation and Rate Distortion
Milad Sefidgaran, Aslan Tchamkerten
A receiver wants to compute a function of two correlated sources separately observed by two transmitters. One of the transmitters may send a possibly private message to the other t…
On the Capacity of the One-Bit Deletion and Duplication Channel
Hamed Mirghasemi, Aslan Tchamkerten
The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of bits which experiences either a deletion, or a duplication, or remains…
Estimating a Random Walk First-Passage Time from Noisy or Delayed Observations
Marat V. Burnashev, Aslan Tchamkerten
A random walk (or a Wiener process), possibly with drift, is observed in a noisy or delayed fashion. The problem considered in this paper is to estimate the first time τthe random…
On Computing a Function of Correlated Sources
Milad Sefidgaran, Aslan Tchamkerten
A receiver wants to compute a function f of two correlated sources X and Y and side information Z. What is the minimum number of bits that needs to be communicated by each transmit…
On Bounded Weight Codes
Christine Bachoc, Venkat Chandar, Gerard Cohen +2
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in term…
Asynchronous Capacity per Unit Cost
Venkat Chandar, Aslan Tchamkerten, David Tse
The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the tra…
Training-Based Schemes are Suboptimal for High Rate Asynchronous Communication
Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell
We consider asynchronous point-to-point communication. Building on a recently developed model, we show that training based schemes, i.e., communication strategies that separate syn…
Optimal Sequential Frame Synchronization
Venkat Chandar, Aslan Tchamkerten, Gregory Wornell
We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assum…
Communication under Strong Asynchronism
Aslan Tchamkerten, Venkat Chandar, Gregory Wornell
We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distribut…