activity
20172022
most citedImproved Upper Bound on the Network Function Computing Capacity

1 citations · 2 across the 3 of their papers we have counts for

collaborators

8 papers

cs.IT2022

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…

cs.IT2021

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…

cs.IT20211 cited

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…

cs.IT2020

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…

cs.IT2018

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…

cs.IT2018

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…