1 citations · 1 across the 6 of their papers we have counts for
6 papers
Dependence Analysis and Structured Construction for Batched Sparse Code
Jiaxin Qing, Xiaohong Cai, Yijun Fan +2
In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random c…
Proving Information Inequalities by Gaussian Elimination
Laigang Guo, Raymond W. Yeung, Xiao-Shan Gao
The proof of information inequalities and identities under linear constraints on the information measures is an important problem in information theory. For this purpose, ITIP and…
Sliding Secure Symmetric Multilevel Diversity Coding
Tao Guo, Laigang Guo, Yinfei Xu +3
Symmetric multilevel diversity coding (SMDC) is a source coding problem where the independent sources are ordered according to their importance. It was shown that separately encodi…
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…
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…