output
20102026
most citedDirichlet Process Hidden Markov Multiple Change-point Model

54 citations

Showing 2015Show all

6 papers · 1 filter

cs.NI2015★ 1 cited

Asymptotic Approximations for TCP Compound

Sudheer Poojary, Vinod Sharma

In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model e…

cs.IT2015

Decoding Network Codes using the Sum-Product Algorithm

Anindya Gupta, B. Sundar Rajan

While feasibility and obtaining a solution of a given network coding problem are well studied, the decoding procedure and complexity have not garnered much attention. We consider t…

cs.IT2015★ 4 cited

On The Number of Optimal Linear Index Codes For Unicast Index Coding Problems

Kavitha R., Niranjana Ambadi, B. Sundar Rajan

An index coding problem arises when there is a single source with a number of messages and multiple receivers each wanting a subset of messages and knowing a different set of messa…

math.ST2015★ 54 cited

Dirichlet Process Hidden Markov Multiple Change-point Model

Stanley I. M. Ko, Terence T. L. Chong, Pulak Ghosh

This paper proposes a new Bayesian multiple change-point model which is based on the hidden Markov approach. The Dirichlet process hidden Markov model does not require the specific…

cs.IT2015

Vector Linear Error Correcting Index Codes and Discrete Polymatroids

Anoop Thomas, B. Sundar Rajan

The connection between index coding and matroid theory have been well studied in the recent past. El Rouayheb et al. established a connection between multi linear representation of…

cs.IT2015

Error Correcting Index Codes and Matroids

Anoop Thomas, B. Sundar Rajan

The connection between index coding and matroid theory have been well studied in the recent past. El Rouayheb et al. established a connection between multilinear representation of…