Ning Cai

Network error correction, part I: Basic concepts and upper bounds (2006)

For two matrix operations, called quasi--direct sum and quasi--outer product, we determine their deviations from multiplicative behaviour of the rank. The second operation arises in the determination...

Raymond W. Yeung, Ning Cai

Abstract. Error correction in existing point-to-point communication networks is done on a link-by-link basis, which is referred to in this paper as classical error correction. Inspired by network...

Linear network coding (2003)

Senior Member, Raymond W. Yeung, Ning Cai

Abstract—Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received...

Network information flow (2000)

Rudolf Ahlswede, Ning Cai, Raymond W. Yeung, Senior Member, Senior Member

Abstract—We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a point-to-point communication network on which a number...

On Interactive Communication (1997)

It is well--known that the deterministic code capacity (for the average error probability criterion) of an arbitrarily varying channel (AVC) either equals its random code capacity or zero. Here it is...

Shadows And Isoperimetry Under The Sequence-Subsequence Relation (1997)

Almost two decades ago Ahlswede introduced an abstract correlated source (V \Theta W;S) with outputs (v; w) 2 S ae V \Theta W , where persons P V and PW observe v and w , resp. More recently Orlitsky...

Incomparability And Intersection Properties Of Boolean Interval Lattices And Chain Posets (1996)

this paper we consider sequences and subsequences rather than sets and subsets. The basic objects are X

Cross-Disjoint Pairs Of Clouds In The Interval Lattice (1996)

In a canonical way we establish an AZ--identity (see [9]) and its consequences, the LYM--inequality and the Sperner--property, for the Boolean interval lattice. Further, the Bollobas--inequality for...

Rudolf Ahlswede, Ning Cai, A B [a

Let I n be the lattice of intervals in the Boolean lattice L n . For A; B ae I n the pair of clouds (A; B) is cross--disjoint, if I " J = OE for I 2 A , J 2 B . We prove that for such pairs...

Information and Control: Matching Channels (1995)

Erasure, List And Detection Zero-Error Capacities For Low Noise And A Relation To Identification (1994)

The transmission problem for noisy channels is usually studied under the condition that the decoding error probability is small and is sometimes studied under the condition that = 0 . Here we just...

On Partitioning And Packing Products With Rectangles (1994)

For the discrete memoryless channel (X ; Y; W ) we give characterisations of the zero-- error erasure capacity C er and the zero--error average list size capacity C a` in terms of limits of suitable...

Communication complexity in Lattices (1993)

In [1] we introduced and studied for product hypergraphs H n = Q n i=1 H i , where H i = (V i ; E i ) , the minimal size ß(H n ) of a partition of V n = Q n i=1 V i into sets that are elements of E...

Rudolf Ahlswede, Ning Cai, Ulrich Tamm

Let X denote a finite lattice and let f: X! Z be a function mapping X into some set Z. In

Communication Complexity In Lattices (1993)

Rudolf Ahlswede, Ning Cai, Ulrich Tamm

this paper the logarithm is always taken to the base 2. The following lower bound is due to Mehlhorn and Schmidt [1]:

On Extremal Set Partitions In Cartesian Product Spaces (1993)

Models of Multi-User Write-Efficient Memories and General Diametric Theorems (1993)

Introduction Consider (V; E) , where V is a finite set and E is a system of subsets of V . For the cartesian products V n = Q n 1 V and E n = Q n 1 E let ß(n) denote the minimal size of a partition...

Rich Colorings With Local Constraints (1992)

Write--efficient memories (WEM) were introduced by Ahlswede/Zhang as a model for storing and updating information on a rewritable medium. We strengthen the capacity theorem by providing a full...

On Sets Of Words With Pairwise Common Letter In Different Positions (1991)

A new hypergraph coloring problem is introduced by defining N(H; e) as the maximal number of colors in a vertex coloring of a hypergraph H = (V; E) , which has not more than e different colors in...

A Generalization Of The AZ Identity (1990)

Introduction and results 1 For a finite (or infinite) alphabet X ff = f1; 2; : : : ; ffg we consider the set of words of length n X n ff = fx n = (x 1 ; x 2 ; : : : ; x n ) : x t 2 X ff for t = 1; 2;...

Glycosaminoglycan and glycoprotein in extracellular matrix of developing chick sympathetic ganglia. (1989)

. The identity discovered in [1] can be viewed as a sharpening of the LYM inequality ([3], [4], [5]). It was extended in [2] so that it covers also Bollobas' inequality [6]. Here we present a...

Cai, Ning.

Thesis (M.S.)--Ohio University, August, 1989.

4-Words [Words] an diametrical inequalities. (1988)

Cai, Ning.

Bielefeld, Univ., Diss., 1988.

On first passage times of a hyper-exponential jump diffusion process (0000)

Pricing double-barrier options under a flexible jump diffusion model (0000)

We investigate some important probabilistic properties relating to the first passage time of a hyper-exponential jump diffusion process, including its finiteness, expectation, conditional...

Viscoelastic behaviour of human mesenchymal stem cells

In this paper we present a Laplace transform-based analytical solution for pricing double-barrier options under a flexible hyper-exponential jump diffusion model (HEM). The major theoretical...

Tan, Samuel CW, Pan, Wen X, Ma, Gang, Cai, Ning, Leong, Kam W, Liao, Kin

General edge-isoperimetric inequalities Part I. Informationtheoretical methods

Informationtheoretical Methods, Rudolf Ahlswede, Ning Cai

Introduction In Combinatorics we often meet two kinds of extremal problems. In one kind optimal configurations consist of "objects", which are somehow uniformly spread in the space under...

A New Direction In Extremal Theory

General edge-isoperimetric inequalities Part II. A local-global principle for lexicographical solutions

this paper we essentially start from first principles. With the notion of clouds we continue the terminology of [1] and [2]. This and other concepts used are such that they directly can be...

On first passage times of a hyper-exponential jump diffusion process

Introduction The lexicographical order L on a sequence space X n = f0; 1; : : : ; ffg n , defined by x n ! L ! y n iff there exists a t such that x t ! y t and x s = y s for s ! t, is one of the most...

Pricing double-barrier options under a flexible jump diffusion model

We investigate some important probabilistic properties relating to the first passage time of a hyper-exponential jump diffusion process, including its finiteness, expectation, conditional...