Ning Cai

According to our database1, Ning Cai authored at least 82 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Corrections to "Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes".
IEEE Trans. Inf. Theory, 2020

Secure Network Code for Adaptive and Active Attacks With No-Randomness in Intermediate Nodes.
IEEE Trans. Inf. Theory, 2020

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks.
Entropy, 2020

Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution.
CoRR, 2020

Secure network code over one-hop relay network.
CoRR, 2020

2019
Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources.
IEEE Trans. Inf. Theory, 2019

Some Results on Network Error Correction With Time-Varying Adversarial Errors.
IEEE Trans. Commun., 2019

Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy.
Proceedings of the IEEE International Workshop on Information Forensics and Security, 2019

Message Transmission over Classical Quantum Channels with a Jammer with Side Information, Correlation as Resource and Common Randomness Generating.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On Zero-Error Capacity of Binary Channels With One Memory.
IEEE Trans. Inf. Theory, 2018

On Capacity of Network Error Correction Coding With Random Errors.
IEEE Commun. Lett., 2018

Network Error Correction Coding for Time-Varying Adversarial Errors in a Unicast Network.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Message Transmission over Classical Quantum Channels with a Jammer with Side Information.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Secrecy and robustness for active attack in secure network coding.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
List Decoding for Arbitrarily Varying Multiple Access Channel Revisited: List Configuration and Symmetrizability.
IEEE Trans. Inf. Theory, 2016

Strong secrecy capacity of the wiretap channel II with DMC main channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Classical-quantum channels with causal and non-causal channel state information at the sender.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Subspace Coding for Networks with Different Level Messages.
Entropy, 2015

The Classical-Quantum Channel with Random State Parameters Known to the Sender.
CoRR, 2015

Zero-error capacity of binary channels with 1-memory.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Wiretap Channel with Correlated Sources.
Proceedings of the 2014 IEEE International Conference on Cloud Engineering, 2014

2013
Localized Dimension Growth: A Convolutional Random Network Coding Approach to Managing Memory and Decoding Delay.
IEEE Trans. Commun., 2013

Secrecy capacities of compound quantum wiretap channels and applications
CoRR, 2013

Cross-Disjoint Pairs of Clouds in the Interval Lattice.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
Time-Variant Decoding of Convolutional Network Codes.
IEEE Commun. Lett., 2012

Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
A Unified Framework for Linear Network Coding.
IEEE Trans. Inf. Theory, 2011

Secure Network Coding on a Wiretap Network.
IEEE Trans. Inf. Theory, 2011

Theory of Secure Network Coding.
Proc. IEEE, 2011

Convolutional Network Coding Based on Matrix Power Series Representation
CoRR, 2011

Localized dimension growth in random network coding: A convolutional approach.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
The Minimum Decoding Delay for Convolutional Network Coding.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

The arbitrarily varying channel when the jammer knows the channel input.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Reliable Communication in the Absence of a Common Clock.
IEEE Trans. Inf. Theory, 2009

Robust key agreement schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On the optimality of a construction of secure network codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
A Security Condition for Multi-Source Linear Network Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Introduction to the special issue on networking and information theory.
IEEE/ACM Trans. Netw., 2006

Network Error Correction, II: Lower Bounds.
Commun. Inf. Syst., 2006

Network Error Correction, I: Basic Concepts and Upper Bounds.
Commun. Inf. Syst., 2006

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

Search with Noisy and Delayed Responses.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Network Coding Theory - Part II: Multiple Source.
Found. Trends Commun. Inf. Theory, 2005

Network Coding Theory - Part I: Single Source.
Found. Trends Commun. Inf. Theory, 2005

Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers.
Electron. Notes Discret. Math., 2005

Watermarking Identification Codes with Related Topics on Common Randomness.
Electron. Notes Discret. Math., 2005

Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder.
Electron. Notes Discret. Math., 2005

Search with noisy and delayed response.
Electron. Notes Discret. Math., 2005

Codes with the identifiable parent property and the multiple-access channel.
Electron. Notes Discret. Math., 2005

A Strong Converse Theorem for Quantum Multiple Access Channels.
Electron. Notes Discret. Math., 2005

A Kraft-type inequality for d-delay binary search codes.
Electron. Notes Discret. Math., 2005

On theory of linear network coding.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
On Lossless Quantum Data Compression With a Classical Helper.
IEEE Trans. Inf. Theory, 2004

Quantum privacy and quantum wiretap channels.
Probl. Inf. Transm., 2004

2003
Linear network coding.
IEEE Trans. Inf. Theory, 2003

2002
Seminoisy deterministic multiple-access channels: Coding theorems for list codes and codes with feedback.
IEEE Trans. Inf. Theory, 2002

Parallel error correcting codes.
IEEE Trans. Inf. Theory, 2002

Network coding and error correction.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.
Probl. Inf. Transm., 2001

2000
Network information flow.
IEEE Trans. Inf. Theory, 2000

1999
Identification without randomization.
IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission.
IEEE Trans. Inf. Theory, 1999

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True.
IEEE Trans. Inf. Theory, 1999

A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.
Comb. Probab. Comput., 1999

1998
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.
IEEE Trans. Inf. Theory, 1998

Information and Control: Matching Channels.
IEEE Trans. Inf. Theory, 1998

1997
On interactive communication.
IEEE Trans. Inf. Theory, 1997

Correlated sources help transmission over an arbitrarily varying channel.
IEEE Trans. Inf. Theory, 1997

Models of Multi-User Write-Efficient Memories and General Diametric Theorems.
Inf. Comput., 1997

General Edge-isoperimetric Inequalities, Part II: a Local-Global Principle for Lexicographical Solutions.
Eur. J. Comb., 1997

General Edge-isoperimetric Inequalities, Part I: Information-theoretical Methods.
Eur. J. Comb., 1997

Shadows and Isoperimetry Under the Sequence-Subsequence Relation.
Comb., 1997

1996
Erasure, list, and detection zero-error capacities for low noise and a relation to identification.
IEEE Trans. Inf. Theory, 1996

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets.
Eur. J. Comb., 1996

1994
On communication complexity of vector-valued functions.
IEEE Trans. Inf. Theory, 1994

On Partitioning and Packing Products with Rectangles.
Comb. Probab. Comput., 1994

1993
On Extremal Set Partitions in Cartesian Product Spaces.
Comb. Probab. Comput., 1993

A generalization of the AZ identity.
Comb., 1993

Rank Formulas for Certain Products of Matrices.
Appl. Algebra Eng. Commun. Comput., 1993

1992
Diametric theorems in seuence spaces.
Comb., 1992

1991
Two proofs of Pinsker's conjecture concerning arbitrarily varying channels.
IEEE Trans. Inf. Theory, 1991


  Loading...