Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

Coded source compression, also known as source compression with helpers, has been a major variant of distributed source… Expand

Is this relevant?

2014

2014

Covering a directed graph by a Hamiltonian path or a set of words by a superstring belong to well studied optimisation problems… Expand

Is this relevant?

2007

2007

This is the third of three papers about the Compression Theorem: if M m is embedded in Q q R with a normal vector eld and if q… Expand

Is this relevant?

2005

2005

We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols… Expand

Is this relevant?

2002

2002

We analyze the performance of a linear code used for data compression of a Slepian-Wolf type. In our framework, two correlated… Expand

Is this relevant?

2001

2001

We analyze the performance of a linear code used for a data compression of Slepian-Wolf type. In our framework, two correlated… Expand

Is this relevant?

1997

1997

AbstractSuppose AiBiCi (i = 1, 2) are two triangles of equal side lengths lying on spheres Φi with radii r1, r2 (r1 < r2… Expand

Is this relevant?

1987

1987

A Cohen-Macaulay complex is said to be balanced of typea=(a1,a2, ...,as) if its vertices can be colored usings colors so that… Expand

Is this relevant?

Highly Cited

1975

Highly Cited

1975

If \{(X_i, Y_i)\}_{i=1}^{\infty} is a sequence of independent identically distributed discrete random pairs with (X_i, Y_i) ~ p(x… Expand

Is this relevant?