Two proofs of Pinsker's conjecture concerning arbitrarily varying channels. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1991)

Diametric theorems in seuence spaces. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (Comb., 1992)

Rank Formulas for Certain Products of Matrices. - Rudolf Ahlswede; Ning Cai 001 (Appl. Algebra Eng. Commun. Comput., 1993)

A generalization of the AZ identity. - Rudolf Ahlswede; Ning Cai 001 (Comb., 1993)

On Extremal Set Partitions in Cartesian Product Spaces. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1993)

On Partitioning and Packing Products with Rectangles. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1994)

On communication complexity of vector-valued functions. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1994)

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1996)

Erasure, list, and detection zero-error capacities for low noise and a relation to identification. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1996)

Shadows and Isoperimetry Under the Sequence-Subsequence Relation. - Rudolf Ahlswede; Ning Cai 001 (Comb., 1997)

General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1997)

General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions. - Rudolf Ahlswede; Ning Cai 001 (Eur. J. Comb., 1997)

Models of Multi-User Write-Efficient Memories and General Diametric Theorems. - Rudolf Ahlswede; Ning Cai 001 (Inf. Comput., 1997)

Correlated sources help transmission over an arbitrarily varying channel. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1997)

On interactive communication. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1997)

Information and Control: Matching Channels. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1998)

Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel. - Rudolf Ahlswede; Ning Cai 001; Zhen Zhang 010 (IEEE Trans. Inf. Theory, 1998)

A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. - Rudolf Ahlswede; Ning Cai 001 (Comb. Probab. Comput., 1999)

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Identification without randomization. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 1999)

Network information flow. - Rudolf Ahlswede; Ning Cai 001; Shuo-Yen Robert Li; Raymond W. Yeung (IEEE Trans. Inf. Theory, 2000)

An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection. - Rudolf Ahlswede; Ning Cai 001; Christian Deppe (Probl. Inf. Transm., 2001)

Network coding and error correction. - Ning Cai 001; Raymond W. Yeung (ITW, 2002)

Parallel error correcting codes. - Rudolf Ahlswede; Bernhard Balkenhol; Ning Cai 001 (IEEE Trans. Inf. Theory, 2002)

Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2002)

Linear network coding. - Shuo-Yen Robert Li; Raymond W. Yeung; Ning Cai 001 (IEEE Trans. Inf. Theory, 2003)

Quantum privacy and quantum wiretap channels. - Ning Cai 001; Andreas J. Winter 002; Raymond W. Yeung (Probl. Inf. Transm., 2004)

On Lossless Quantum Data Compression With a Classical Helper. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2004)

On theory of linear network coding. - Shuo-Yen Robert Li; Ning Cai 001; Raymond W. Yeung (ISIT, 2005)

A Kraft-type inequality for d-delay binary search codes. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

A Strong Converse Theorem for Quantum Multiple Access Channels. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Codes with the identifiable parent property and the multiple-access channel. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Search with noisy and delayed response. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Watermarking Identification Codes with Related Topics on Common Randomness. - Rudolf Ahlswede; Ning Cai 001 (Electron. Notes Discret. Math., 2005)

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. - Rudolf Ahlswede; Ning Cai 001; Zhaozhi Zhang (Electron. Notes Discret. Math., 2005)

Network Coding Theory - Part I: Single Source. - Raymond W. Yeung; Shuo-Yen Robert Li; Ning Cai 001; Zhen Zhang 010 (Found. Trends Commun. Inf. Theory, 2005)

Network Coding Theory - Part II: Multiple Source. - Raymond W. Yeung; Shuo-Yen Robert Li; Ning Cai 001; Zhen Zhang 010 (Found. Trends Commun. Inf. Theory, 2005)

Search with Noisy and Delayed Responses. - Rudolf Ahlswede; Ning Cai 001 (GTIT-C, 2006)

Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. - Rudolf Ahlswede; Ning Cai 001 (GTIT-C, 2006)

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. - Rudolf Ahlswede; Ning Cai 001; Zhaozhi Zhang (GTIT-C, 2006)

Private Capacity of Broadcast Channels. - Ning Cai 001 (GTIT-C, 2006)

Network Error Correction, I: Basic Concepts and Upper Bounds. - Ning Cai 001; Raymond W. Yeung (Commun. Inf. Syst., 2006)

Network Error Correction, II: Lower Bounds. - Ning Cai 001; Raymond W. Yeung (Commun. Inf. Syst., 2006)

An Interpretation of Identification Entropy. - Rudolf Ahlswede; Ning Cai 001 (IEEE Trans. Inf. Theory, 2006)

Introduction to the special issue on networking and information theory. - Ning Cai 001; Mung Chiang; Michelle Effros; Ralf Koetter; Muriel Médard; Balaji Prabhakar; R. Srikant 001; Donald F. Towsley; Raymond W. Yeung (IEEE/ACM Trans. Netw., 2006)

A Security Condition for Multi-Source Linear Network Coding. - Ning Cai 001; Raymond W. Yeung (ISIT, 2007)

On the optimality of a construction of secure network codes. - Raymond W. Yeung; Ning Cai 001 (ISIT, 2008)

Robust key agreement schemes. - Terence Chan; Ning Cai 001; Alex J. Grant (ISIT, 2009)

Reliable Communication in the Absence of a Common Clock. - Raymond W. Yeung; Ning Cai 001; Siu-Wai Ho; Aaron B. Wagner (IEEE Trans. Inf. Theory, 2009)

The arbitrarily varying channel when the jammer knows the channel input. - Ning Cai 001; Terence Chan; Alex J. Grant (ISIT, 2010)

The Minimum Decoding Delay for Convolutional Network Coding. - Wangmei Guo; Ning Cai 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Localized dimension growth in random network coding: A convolutional approach. - Wangmei Guo; Ning Cai 001; Xiaomeng Shi; Muriel Médard (ISIT, 2011)

Analog network coding in the generalized high-SNR regime. - Binyue Liu; Ning Cai 001 (ISIT, 2011)

Convolutional Network Coding Based on Matrix Power Series Representation - Wangmei Guo; Ning Cai 001; Qifu Tyler Sun (CoRR, 2011)

Theory of Secure Network Coding. - Ning Cai 001; Terence Chan (Proc. IEEE, 2011)

Secure Network Coding on a Wiretap Network. - Ning Cai 001; Raymond W. Yeung (IEEE Trans. Inf. Theory, 2011)

A Unified Framework for Linear Network Coding. - Min Tan; Raymond W. Yeung; Siu-Ting Ho; Ning Cai 001 (IEEE Trans. Inf. Theory, 2011)

Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels. - Minglai Cai; Ning Cai 001; Christian Deppe (ISIT, 2012)

Multi-hop Analog Network Coding: An Amplify-and-Forward Approach - Binyue Liu; Ning Cai 001 (CoRR, 2012)

Time-Variant Decoding of Convolutional Network Codes. - Wangmei Guo; Ning Cai 001; Qifu Tyler Sun (IEEE Commun. Lett., 2012)

Cross-Disjoint Pairs of Clouds in the Interval Lattice. - Rudolf Ahlswede; Ning Cai 001 (The Mathematics of Paul Erdős I, 2013)

Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme. - Binyue Liu; Ning Cai 001 (Information Theory, Combinatorics, and Search Theory, 2013)

Secrecy capacities of compound quantum wiretap channels and applications - Holger Boche; Minglai Cai; Ning Cai 001; Christian Deppe (CoRR, 2013)

Localized Dimension Growth: A Convolutional Random Network Coding Approach to Managing Memory and Decoding Delay. - Wangmei Guo; Xiaomeng Shi; Ning Cai 001; Muriel Médard (IEEE Trans. Commun., 2013)

Wiretap Channel with Correlated Sources. - Yanling Chen 001; Ning Cai 001; Aydin Sezgin (IC2E, 2014)

The Maximum Error Probability Criterion, Random Encoder, and Feedback, in Multiple Input Channels. - Ning Cai 001 (Entropy, 2014)

Design of amplify-and-forward relaying schemes for layered relay networks. - Binyue Liu; Ning Cai 001 (IET Commun., 2014)

Zero-error capacity of binary channels with 1-memory. - Qi Cao 003; Ning Cai 001; Wangmei Guo (ISIT, 2015)

The Classical-Quantum Channel with Random State Parameters Known to the Sender. - Holger Boche; Ning Cai 001; Janis Nötzel (CoRR, 2015)

Subspace Coding for Networks with Different Level Messages. - Feng Cai; Ning Cai 001; Wangmei Guo (Entropy, 2015)

Classical-quantum channels with causal and non-causal channel state information at the sender. - Holger Boche; Ning Cai 001; Janis Noetzel (ISIT, 2016)

Strong secrecy capacity of the wiretap channel II with DMC main channel. - Dan He; Yuan Luo; Ning Cai 001 (ISIT, 2016)

List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability. - Ning Cai 001 (IEEE Trans. Inf. Theory, 2016)

Secrecy and robustness for active attack in secure network coding. - Masahito Hayashi; Masaki Owari; Go Kato; Ning Cai 001 (ISIT, 2017)

Message Transmission over Classical Quantum Channels with a Jammer with Side Information. - Holger Boche; Minglai Cai; Ning Cai 001 (ISIT, 2018)

Network Error Correction Coding for Time-Varying Adversarial Errors in a Unicast Network. - Wangmei Guo; Dan He; Ning Cai 001 (ISIT, 2018)

On Capacity of Network Error Correction Coding With Random Errors. - Wangmei Guo; Dan He; Ning Cai 001 (IEEE Commun. Lett., 2018)

On Zero-Error Capacity of Binary Channels With One Memory. - Qi Cao 003; Ning Cai 001; Wangmei Guo; Raymond W. Yeung (IEEE Trans. Inf. Theory, 2018)

Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating. - Holger Boche; Minglai Cai; Ning Cai 001 (ISIT, 2019)

A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity. - Haobo Li 005; Ning Cai 001 (ISIT, 2019)

Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy. - Sebastian Baur; Ning Cai 001; Moritz Wiese; Holger Boche (WIFS, 2019)

Some Results on Network Error Correction With Time-Varying Adversarial Errors. - Wangmei Guo; Dan He; Ning Cai 001 (IEEE Trans. Commun., 2019)

Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources. - Holger Boche; Minglai Cai; Ning Cai 001 (IEEE Trans. Inf. Theory, 2019)

Secure network code over one-hop relay network. - Masahito Hayashi; Ning Cai 001 (CoRR, 2020)

Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution. - Masahito Hayashi; Ning Cai 001 (CoRR, 2020)

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks. - Masahito Hayashi; Masaki Owari; Go Kato; Ning Cai 001 (Entropy, 2020)

Computing Classical-Quantum Channel Capacity Using Blahut-Arimoto Type Algorithm: A Theoretical and Numerical Analysis. - Haobo Li 005; Ning Cai 001 (Entropy, 2020)

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes. - Ning Cai 001; Masahito Hayashi (IEEE Trans. Inf. Theory, 2020)

Corrections to "Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes". - Ning Cai 001; Masahito Hayashi (IEEE Trans. Inf. Theory, 2020)

Universal classical-quantum multiple access channel coding. - Masahito Hayashi; Ning Cai 001 (ISIT, 2021)

Secure Non-Linear Network Code Over a One-Hop Relay Network. - Masahito Hayashi; Ning Cai 001 (IEEE J. Sel. Areas Inf. Theory, 2021)

Asymptotically Secure Network Code for Active Attacks. - Masahito Hayashi; Ning Cai 001 (IEEE Trans. Commun., 2021)

Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding. - Masahito Hayashi; Ning Cai 001 (IEEE Trans. Inf. Theory, 2022)