The following pages link to Raymond W. Yeung (Q193590):
Displaying 23 items.
- Probabilistic Inference Using Function Factorization and Divergence Minimization (Q4900005) (← links)
- On the Discontinuity of the Shannon Information Measures (Q4974083) (← links)
- Reliable Communication in the Absence of a Common Clock (Q4975729) (← links)
- Zero-Error Capacity Regions of Noisy Networks (Q5088545) (← links)
- Proving and Disproving Information Inequalities: Theory and Scalable Algorithms (Q5124521) (← links)
- Local-Encoding-Preserving Secure Network Coding (Q5138785) (← links)
- Weakly Secure Symmetric Multilevel Diversity Coding (Q5138874) (← links)
- On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point (Q5211591) (← links)
- The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding (Q5211652) (← links)
- Improved Upper Bound on the Network Function Computing Capacity (Q5224034) (← links)
- Refined Coding Bounds and Code Constructions for Coherent Network Error Correction (Q5281029) (← links)
- Network Generalized Hamming Weight (Q5281102) (← links)
- A Unified Framework for Linear Network Coding (Q5281137) (← links)
- Secure Network Coding on a Wiretap Network (Q5281138) (← links)
- On Information Divergence Measures and a Unified Typicality (Q5281150) (← links)
- The Interplay Between Entropy and Variational Distance (Q5281151) (← links)
- Variable-Rate Linear Network Coding (Q5281441) (← links)
- BATS Codes: Theory and Practice (Q5369105) (← links)
- Alphabet Size Reduction for Secure Network Coding: A Graph Theoretic Approach (Q5375592) (← links)
- (Q5690363) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)
- Proving information inequalities and identities with symbolic computation (Q6574777) (← links)
- Secure network function computation for linear functions. I: Source security (Q6575648) (← links)
