146 citations · 235 across the 18 of their papers we have counts for
21 papers
Reliable Throughput of Generalized Collision Channel without Synchronization
Yijun Fan, Yanxiao Liu, Yi Chen +2
We consider a generalized collision channel model for general multi-user communication systems, an extension of Massey and Mathys' collision channel without feedback for multiple a…
Secure Network Function Computation for Linear Functions -- Part I: Source Security
Xuan Guang, Yang Bai, Raymond W. Yeung
In this paper, we put forward secure network function computation over a directed acyclic network. In such a network, a sink node is required to compute with zero error a target fu…
Proving Information Inequalities and Identities with Symbolic Computation
Laigang Guo, Raymond W. Yeung, Xiao-Shan Gao
Proving linear inequalities and identities of Shannon's information measures, possibly with linear constraints on the information measures, is an important problem in information t…
Intrablock Interleaving for Batched Network Coding with Blockwise Adaptive Recoding
Hoover H. F. Yin, Ka Hei Ng, Allen Z. Zhong +3
Batched network coding (BNC) is a low-complexity solution to network transmission in multi-hop packet networks with packet loss. BNC encodes the source data into batches of packets…
Linear Network Error Correction Coding: A Revisit
Xuan Guang, Raymond W. Yeung
We consider linear network error correction (LNEC) coding when errors may occur on edges of a communication network of which the topology is known. In this paper, we first revisit…
Weakly Secure Symmetric Multilevel Diversity Coding
Tao Guo, Chao Tian, Tie Liu +1
Multilevel diversity coding is a classical coding model where multiple mutually independent information messages are encoded, such that different reliability requirements can be af…
Local-Encoding-Preserving Secure Network Coding---Part II: Flexible Rate and Security Level
Xuan Guang, Raymond W. Yeung, Fang-Wei Fu
In the two-part paper, we consider the problem of secure network coding when the information rate and the security level can change over time. To efficiently solve this problem, we…
Local-Encoding-Preserving Secure Network Coding---Part I: Fixed Security Level
Xuan Guang, Raymond W. Yeung, Fang-Wei Fu
Information-theoretic security is considered in the paradigm of network coding in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, also r…
On Secure Exact-repair Regenerating Codes with a Single Pareto Optimal Point
Fangwei Ye, Shiqiu Liu, Kenneth W. Shum +1
The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe t…
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding
Tao Guo, Raymond W. Yeung
It is well known that {\em superposition coding}, namely separately encoding the independent sources, is optimal for symmetric multilevel diversity coding (SMDC) (Yeung-Zhang 1999)…
Improved Upper Bound on the Network Function Computing Capacity
Xuan Guang, Raymond W. Yeung, Shenghao Yang +1
The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\em…
Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach
Xuan Guang, Raymond W. Yeung
We consider a communication network where there exist wiretappers who can access a subset of channels, called a wiretap set, which is chosen from a given collection of wiretap sets…
On Information-Theoretic Characterizations of Markov Random Fields and Subfields
Raymond W. Yeung, Ali Al-Bashabsheh, Chao Chen +2
Let form a Markov random field (MRF) represented by an undirected graph , and be a subset of . We determine the smallest graph that can always rep…
Partition-Symmetrical Entropy Functions
Qi Chen, Raymond W. Yeung
Let . The entropy function of a set of discrete random variables is a -dimensional vector whose entries are ${\bf{h}}(…
Cut-Set Bounds for Networks with Zero-Delay Nodes
Silas L. Fong, Raymond W. Yeung
In a network, a node is said to incur a delay if its encoding of each transmitted symbol involves only its received symbols obtained before the time slot in which the transmitted s…
Performance Bounds on a Wiretap Network with Arbitrary Wiretap Sets
Fan Cheng, Raymond W. Yeung
Consider a communication network represented by a directed graph , where is the set of nodes and is the set of po…
Batched Sparse Codes
Shenghao Yang, Raymond W. Yeung
Network coding can significantly improve the transmission rate of communication networks with packet loss compared with routing. However, using network coding usually incurs high c…
Imperfect Secrecy in Wiretap Channel II
Fan Cheng, Raymond W. Yeung, Kenneth W. Shum
In a point-to-point communication system which consists of a sender, a receiver and a set of noiseless channels, the sender wishes to transmit a private message to the receiver thr…
Entropy functions and determinant inequalities
Terence Chan, Dongning Guo, Raymond Yeung
In this paper, we show that the characterisation of all determinant inequalities for positive definite matrices is equivalent to determining the smallest closed and co…
On Linear Operator Channels over Finite Fields
Shenghao Yang, Siu-Wai Ho, Jin Meng +2
Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such…
Refined Coding Bounds and Code Constructions for Coherent Network Error Correction
Shenghao Yang, Raymond W. Yeung, Chi-Kin Ngai
Coherent network error correction is the error-control problem in network coding with the knowledge of the network codes at the source and sink nodes. With respect to a given set o…