#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2005

2015

- This year (0)
- Last five years (15)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Venkat Chandar, Aslan Tchamkerten, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2008

We consider the ldquoone-shot frame synchronization problem,rdquo where a decoder wants to locate a sync pattern at the output of a memoryless channel on the basis of sequential observations. The sync pattern of length <i>N</i> starts being emitted at a random time within some interval of size <i>A</i>, where <i>A</i> characterizes the asynchronism level.… (More)

- Aslan Tchamkerten, Venkat Chandar, Gregory W. Wornell
- IEEE Transactions on Information Theory
- 2009

A formulation of the problem of asynchronous point-to-point communication is developed. In the system model of interest, the message codeword is transmitted over a channel starting at a randomly chosen time within a prescribed window. The length of the window scales exponentially with the codeword length, where the scaling parameter is referred to as the… (More)

- Venkat Chandar
- 2008

In this note, we prove that matrices whose entries are all 0 or 1 cannot achieve good performance with respect to the Restricted Isometry Property (RIP). Most currently known deterministic constructions of matrices satisfying the RIP fall into this category, and hence these constructions suffer inherent limitations. In particular, we show that DeVore's… (More)

- Venkat Chandar, Aslan Tchamkerten, David Tse
- IEEE Transactions on Information Theory
- 2010

The capacity per unit cost, or, equivalently, the minimum cost to transmit one bit, is a well-studied quantity under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with amounts of bits arriving infrequently at random times. In such scenarios, the cost… (More)

- Arya Mazumdar, Venkat Chandar, Gregory W. Wornell
- IEEE Journal on Selected Areas in Communications
- 2014

—Motivated by distributed storage applications, we investigate the degree to which capacity achieving encodings can be efficiently updated when a single information bit changes, and the degree to which such encodings can be efficiently (i.e., locally) repaired when single encoded bit is lost. Specifically, we first develop conditions under which optimum… (More)

- Da Wang, Venkat Chandar, Sae-Young Chung, Gregory W. Wornell
- 2011 IEEE International Symposium on Information…
- 2011

Based on recent work on asynchronous communication, this paper proposes a slotted asynchronous channel model and investigates the fundamental limits of asynchronous communication, in terms of miss and false alarm error exponents. We propose coding schemes that are suitable for various asynchronous communication scenarios, and quantify more precisely the… (More)

- Walter Sun, Müjdat Çetin, +4 authors Alan S. Willsky
- IPMI
- 2005

Having accurate left ventricle (LV) segmentations across a cardiac cycle provides useful quantitative (e.g. ejection fraction) and qualitative information for diagnosis of certain heart conditions. Existing LV segmentation techniques are founded mostly upon algorithms for segmenting static images. In order to exploit the dynamic structure of the heart in a… (More)

- Arya Mazumdar, Gregory W. Wornell, Venkat Chandar
- 2012 IEEE International Symposium on Information…
- 2012

An update efficient code is a mapping from messages to codewords such that small perturbations in the message induce only slight changes to the corresponding codeword. The parameter that captures this notion is called update-efficiency. In this paper we study update-efficient error-correcting codes and develop their basic properties. While update-efficiency… (More)

- Venkat Chandar, Devavrat Shah, Gregory W. Wornell
- 2010 IEEE International Symposium on Information…
- 2010

We consider the recovery of a nonnegative vector x from measurements y = Ax, where A ∈ {0, 1}<sup>m×n</sup>. We establish that when A corresponds to the adjacency matrix of a bipartite graph with sufficient expansion, a simple message-passing algorithm produces an estimate x^ of x satisfying ∥x-x^∥<inf>1</inf> = O(n… (More)

- Venkat Chandar
- 2010