#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2004

2011

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

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

— We investigate source coding in a cascade communication system consisting of an encoder, a relay and an end terminal, where both the relay and the end terminal wish to reconstruct source X with certain fidelities. Additionally, side-informations Z and Y are available at the relay and the end terminal, respectively. The side-information Z at the relay is a… (More)

- Etienne Perron, Dinkar Vasudevan, Milan Vojnovic
- INFOCOM
- 2009

– We consider the binary consensus problem where each node in the network initially observes one of two states and the goal for each node is to eventually decide which one of the two states was initially held by the majority of the nodes. Each node contacts other nodes and updates its current state based on the state communicated by the last contacted node.… (More)

- Satish Babu Korada, Dinkar Vasudevan
- 2008 IEEE International Symposium on Information…
- 2008

We consider source coding over Aref networks. In particular we consider the following two problems: (i) multicasting correlated sources to a set of receivers, (ii) broadcasting sources to their respective receivers. For the first problem we show necessary and sufficient conditions for reliable multicast. For the second problem we show sufficient conditions… (More)

- Dinkar Vasudevan, Satish Babu Korada
- IEEE Transactions on Information Theory
- 2011

We present inner bounds to the broadcast capacity region of two classes of information networks: Networks of Multiple Access Channels (MACs) and Networks of Deterministic Broadcast Channels (DBCs). Our achievability scheme is a separation based scheme consisting of a physical layer that involves “cleaning up” the constituent channels in the… (More)

— Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, we analyze a gossip based protocol where coded messages are exchanged. This problem was studied in [4] where a bound to the dissemination time based on the spectral properties of the underlying communication graph is provided. Our… (More)

- Douglas J. Leith, Dinkar Vasudevan
- 2010 IEEE International Symposium on Information…
- 2010

We define the “reordering channel” which approximates packet communication over multipath networks. We consider deterministic packet arrivals with finite horizon decoding of individual packets and analyze the error probability for a two stage coding scheme.

- Dinkar Vasudevan, Vijay G. Subramanian, Douglas J. Leith
- 2010 IEEE International Symposium on Information…
- 2010

We study packet streaming over an erasure channel with delayed feedback. We consider the lag in playback between the sender and the receiver as the performance criterion and propose and analyze schemes to minimize the lag. We show that at lower delays in feedback, purely retransmission based schemes are better than random linear coding schemes and also… (More)

- D Vasudevan, V Selladurai, P Nagaraj
- Quality assurance
- 2004

Tabled sampling schemes such as MIL-STD-105D offer limited flexibility to quality control engineers in designing sampling plans to meet specific needs. We describe a closed form solution to determine the AQL indexed single sampling plan using an artificial neural network (ANN). To determine the sample size and the acceptance number, feed-forward neural… (More)

- Dinkar Vasudevan
- 2007 Data Compression Conference (DCC'07)
- 2007

We provide bounds to the rate distortion tradeoff of the binary Markov source with the Hamming distance as the distortion measure. The tradeoff has been completely characterized by Gray (1970) for distortions less than a critical value D<sub>c</sub>. Our motivation is to examine the tradeoff for values of distortion above D<sub>c</sub>. Our inner bound to… (More)

- Dinkar Vasudevan, Vijay G. Subramanian, Douglas J. Leith
- 2010 IEEE International Symposium on Information…
- 2010

We consider the problem of scheduling jobs with given start and finish times over two classes of multi-user channels, namely Multiple Access Channels and Degraded Broadcast Channels, and derive necessary and sufficient conditions for feasible scheduling of the jobs.

- ‹
- 1
- ›