Cai, Ning; Zhang, Zhao Zhi
The construction of diversity measures and their inconsistency. (Chinese)
J. Systems Sci. Math. Sci. 4, no. 1, 42--54 (1984).
Cai, Ning
On achievable rate regions of F-codes for correlated sources.
Proceeding of CIE National Symp. on Information Theory (1985).
Cai, Ning
A bound for sizes of code pairs satisfying the strong 4-words property for Lee distance.
J. Systems Sci. Math. Sci. 6, no. 2, 129--135 (1986).
(Reviewer: Siri Krishan Wasan)
Cai, Ning
On the uniquely decodable codes of 3-users 2^N -frequency noiseless MAC
with intensity information. (Chinese)
Acta Electronica Sinica 6, no. 4, 49-56 (1986).
Cai, Ning
On maximum expectation of logarithms of the RV family F(B). (Chinese)
Proceeding of National Conf. on Probability Theory and Statistics (1986).
Zhang, Zhao Zhi; Cai, Ning
On variable length coding with side information for discrete memoryless sources. (Chinese)
Acta Electronica Sinica 3, no. 4, 289-297 (1987).
Cai, N.
4-words and diametrical inequalities.
Ph.D. thesis, University of Bielefeld (1988).
Ahlswede, R.; Cai, N.; Zhang, Z.
A general 4-words inequality with consequences for 2-way communication
complexity.
Adv. in Appl. Math. 10, no. 1, 75-94 (1989).
Ahlswede, R.; Cai, N.; Zhang, Z.
A recursive bound for the number of complete K-subgraphs of a graph.
Topics in combinatorics and graph theory (Oberwolfach, 1990), 37-39,
Physica, Heidelberg, 1990.
Ahlswede, Rudolf; Cai, Ning
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
IEEE Trans. Inform. Theory 37, no. 6, 1647-1649 (1991).
Ahlswede, R.; Cai, N.; Zhang, Z.
Diametric theorems in sequence spaces.
Combinatorica 12, no. 1, 1-17 (1992).
Ahlswede, Rudolf; Cai, Ning
A generalization
of the AZ identity.
Combinatorica 13, no. 3, 241-247 (1993).
Ahlswede, Rudolf; Cai, Ning
Rank formulas for certain products of matrices.
Appl. Algebra Engrg. Comm. Comput. 4, no. 4, 253-261 (1993).
Ahlswede, Rudolf; Cai, Ning
On extremal set partitions in Cartesian product spaces.
Combin. Probab. Comput. 2, no. 3, 211-220 (1993).
Ahlswede, Rudolf; Cai, Ning; Tamm, Ulrich
Communication complexity in lattices.
Appl. Math. Lett. 6, no. 6, 53-58 (1993).
Ahlswede, R.; Cai, N.
Two-way communication complexity of sum-type functions for one processor to be
informed. (Russian)
Problemy Peredachi Informatsii 30, no. 1, 3-12 (1994);
translation in Problems Inform. Transmission 30, no. 1, 1-10 (1994).
Ahlswede, Rudolf; Cai, Ning
On partitioning and packing products with rectangles.
Combin. Probab. Comput. 3, no. 4, 429-434 (1994).
Ahlswede, Rudolf; Cai, Ning
On communication complexity of vector-valued functions.
IEEE Trans. Inform. Theory 40, no. 6, 2062-2067 (1994).
Ahlswede, R.; Cai, Ning
On sets of words with pairwise common letter in different positions.
Extremal problems
for finite sets (Visegrád, 1991), 25-38, Bolyai Soc. Math.
Stud., 3,
János Bolyai Math. Soc., Budapest, 1994.
Ahlswede, R.; Cai, N.; Zhang, Z.
A new direction in extremal theory.
J. Combin. Inform. System Sci. 19, no. 3-4, 269-280 (1994).
Ahlswede, Rudolf; Cai, Ning
Incomparability
and intersection properties of Boolean interval lattices and chain posets.
European J. Combin. 17, no. 8, 677-687 (1996).
Ahlswede, Rudolf; Cai, Ning
On extremal set partitions in Cartesian product spaces.
Combinatorics, geometry and probability (Cambridge, 1993), 23-32,
Cambridge Univ. Press, Cambridge, 1997.
Ahlswede, Rudolf; Cai, Ning; Zhang, Zhen
On interactive communication.
IEEE Trans. Inform. Theory 43, no. 1, 22-37 (1997).
Ahlswede, Rudolf; Cai, Ning
Cross-disjoint pairs of clouds in the interval lattice.
The mathematics of Paul Erdös, I, 155-164,
Algorithms Combin., 13,
Springer, Berlin, 1997.
Ahlswede, Rudolf; Cai, Ning
General edge-isoperimetric inequalities. I. Information-theoretical methods.
European J. Combin. 18, no. 4, 355-372 (1997).
Ahlswede, Rudolf; Cai, Ning
Models of multi-user
write-efficient memories and general diametric theorems.
Inform. and
Comput. 135, no. 1, 37-67 (1997).
Ahlswede, Rudolf; Cai, Ning
Correlated
sources help transmission over an arbitrarily varying channel.
IEEE
Trans. Inform. Theory 43, no. 4, 1254-1255 (1997).
Ahlswede, Rudolf; Cai, Ning
General edge-isoperimetric
inequalities. II. A local-global principle for lexicographical solutions.
European J. Combin. 18, no. 5, 479-489 (1997).
Ahlswede, Rudolf; Cai, Ning
Shadows and
isoperimetry under the sequence-subsequence relation.
Combinatorica 17, no. 1, 11-29 (1997).
Hauptseite
main site