# Ning Cai

## Contact Details

NameNing Cai |
||

Affiliation |
||

Location |
||

## Pubs By Year |
||

## Pub CategoriesComputer Science - Information Theory (10) Mathematics - Information Theory (10) Quantum Physics (4) Computer Science - Multiagent Systems (1) Physics - Physics and Society (1) |

## Publications Authored By Ning Cai

In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential probability of error. Thus we re-obtain the direct coding theorem. Read More

This letter deals with the controllability issue of complex networks. An index is chosen to quantitatively measure the extent of controllability of given network. The effect of this index is analyzed based on empirical studies on various classes of network topologies, such as random network, small-world network, and scale-free network. Read More

We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a finite set (cq-channel with state information at the sender). We distinguish between causal and non-causal channel state information at the sender. Read More

This paper introduces a novel approach of clustering, which is based on group consensus of dynamic linear high-order multi-agent systems. The graph topology is associated with a selected multi-agent system, with each agent corresponding to one vertex. In order to reveal the cluster structure, the agents belonging to a similar cluster are expected to aggregate together. Read More

This paper develops a dynamic agent-based model for rural-urban migration, based on the previous relevant works. The model conforms to the typical dynamic linear multi-agent systems model concerned extensively in systems science, in which the communication network is formulated as a digraph. Simulations reveal that consensus of certain variable could be harmful to the overall stability and should be avoided. Read More

This paper introduces a conception that any weighted directed network topology is almost decouplable, which can help to transform the topology into a similar form being composed of uncoupled vertices, and thus reduce the complexity of analysis for networked dynamical systems. As an example of its application, the consensus problem of linear multi-agent systems with time-varying network topologies is addressed. As a result, a necessary and sufficient condition for uniform consensus is proposed. Read More

Swarm stability is concerned for descriptor compartmental networks with linear time-invariant protocol. Compartmental network is a specific type of dynamical multi-agent system. Necessary and sufficient conditions for both consensus and critical swarm stability are presented, which require a joint matching between the interactive dynamics of nearest neighboring vertices and the Laplacian spectrum of the overall network topology. Read More

We determine the secrecy capacity of the compound channel with quantum wiretapper and channel state information at the transmitter. Moreover, we derive a lower bound on the secrecy capacity of this channel without channel state information and determine the secrecy capacity of the compound classical-quantum wiretap channel with channel state information at the transmitter. We use this result to derive a new proof for a lower bound on the entanglement generating capacity of compound quantum channel. Read More

This paper investigates amplify-and-forward (AF) schemes for both one and two-way relay channels. Unlike most existing works assuming independent noise at the relays, we consider a more general scenario with correlated relay noise. We first propose an approach to efficiently solve a class of quadratically constrained fractional problems via second-order cone programming (SOCP). Read More

In this paper, we study the performance of an amplify-and-forward (AF) based analog network coding (ANC) relay scheme in a multi-hop wireless network under individual power constraints. In the first part, a unicast scenario is considered. The problem of finding the maximum achievable rate is formulated as an optimization problem. Read More

We determine the capacity of the classical compound quantum wiretapper channel with channel state information at the transmitter. Moreover we derive a lower bound on the capacity of this channel without channel state information and determine the capacity of the classical quantum compound wiretap channel with channel state information at the transmitter. Read More

In this paper, convolutional network coding is formulated by means of matrix power series representation of the local encoding kernel (LEK) matrices and global encoding kernel (GEK) matrices to establish its theoretical fundamentals for practical implementations. From the encoding perspective, the GEKs of a convolutional network code (CNC) are shown to be uniquely determined by its LEK matrix $K(z)$ if $K_0$, the constant coefficient matrix of $K(z)$, is nilpotent. This will simplify the CNC design because a nilpotent $K_0$ suffices to guarantee a unique set of GEKs. Read More

In a recent paper [4], Mari\'c et al. analyzed the performance of the analog network coding (ANC) in a layered relay network for the high-SNR regime. They have proved that under the ANC scheme, if each relay transmits the received signals at the upper bound of the power constraint, the transmission rate will approach the network capacity. Read More

We propose an efficient Adaptive Random Convolutional Network Coding (ARCNC) algorithm to address the issue of field size in random network coding. ARCNC operates as a convolutional code, with the coefficients of local encoding kernels chosen randomly over a small finite field. The lengths of local encoding kernels increase with time until the global encoding kernel matrices at related sink nodes all have full rank. Read More

This paper considers a key agreement problem in which two parties aim to agree on a key by exchanging messages in the presence of adversarial tampering. The aim of the adversary is to disrupt the key agreement process, but there are no secrecy constraints (i.e. Read More