Name
Papers
Collaborators
CHIH-CHUN WANG
83
53
Citations 
PageRank 
Referers 
795
55.20
1377
Referees 
References 
1011
1008
Search Limit
1001000
Title
Citations
PageRank
Year
Channel Capacity for Adversaries with Computationally Bounded Observations.00.342022
Random Linear Streaming Codes In The Finite Memory Length And Decoding Deadline Regime00.342021
On Finite-Length Analysis And Channel Dispersion For Broadcast Packet Erasure Channels With Feedback00.342021
Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime00.342020
Backhauling Many Devices - Relay Schemes for Massive Random Access Networks.00.342020
On The Optimal Delay Amplification Factor Of Multi-Hop Relay Channels00.342019
Coded Caching with Heterogeneous File Demand Sets — The Insufficiency of Selfish Coded Caching20.382019
Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case10.352019
Closing The Gap For Coded Caching With Distinct File Sizes10.362019
When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?10.362018
Flexible Fractional Repetition Codes for Distributed Storage Networks.10.362018
Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair.00.342018
On The Rate-Cost Of Gaussian Linear Control Systems With Random Communication Delays10.352018
Inter-Session Network Coding Schemes for 1-to-2 Downlink Access-Point Networks With Sequential Hard Deadline Constraints10.352017
Transcoding: A new strategy for relay channels.00.342017
Robust and Optimal Opportunistic Scheduling for Downlink Two-Flow Network Coding With Varying Channel Quality and Rate Adaptation.00.342017
Timely Wireless Flows With General Traffic Patterns: Capacity Region and Scheduling Algorithms.30.372017
Timely Wireless Flows With Arbitrary Traffic Patterns: Capacity Region And Scheduling Algorithms10.362016
When Can Helper Node Selection Improve Regenerating Codes? Part II: An Explicit Exact-Repair Code Construction.10.392016
Locally Repairable Regenerating Code Constructions.00.342016
When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis.20.412016
General Capacity Region for the Fully Connected Three-Node Packet Erasure Network.00.342016
Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures).10.352016
Toward Optimal Distributed Monitoring of Multi-Channel Wireless Networks.10.372016
The two-unicast problem10.362015
Two-unicast is hard120.612014
When and by how much can helper node selection improve regenerating codes?20.392014
Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality90.482014
Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirement10.352013
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels with Noisy Channel Output Feedback.00.342013
Graph-Theoretic Characterization of The Feasibility of The Precoding-Based 3-Unicast Interference Alignment Scheme00.342013
Toward optimal sniffer-channel assignment for reliable monitoring in multi-channel wireless networks40.402013
Gibbs-Sampling-Based Optimization For The Deployment Of Small Cells In 3g Heterogeneous Networks10.382013
Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels40.392013
On the Capacity of 1-to- Broadcast Packet Erasure Channels With Channel Output Feedback401.752012
Pacifier: high-throughput, reliable multicast without "Crying babies" in wireless mesh networks210.752012
Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback80.652012
On the error-prone substructures for the binary-input ternary-output channel and its corresponding exhaustive search algorithm10.382012
Distributed online channel assignment toward optimal monitoring in multi-channel wireless networks160.652012
Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder100.802012
Fast rendezvous for multiple clients for cognitive radios using coordinated channel hopping220.822012
Analysis of precoding-based intersession network coding and the corresponding 3-unicast interference alignment scheme.10.342011
Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints160.632011
FEC-based AP downlink transmission schemes for multiple flows: Combining the reliability and throughput enhancement of intra- and inter-flow coding100.802011
The impact of inter-layer network coding on the relative performance of MRC/MDC WiFi media delivery30.462011
Common information of random linear network coding over a 1-hop broadcast packet erasure channel00.342011
On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-Video Broadcast with Hard Deadline Constraints561.782011
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments682.032011
Efficient Online WiFi Delivery of Layered-Coding Media Using Inter-layer Network Coding30.442011
A low-complexity congestion control and scheduling algorithm for multihop wireless networks with order-optimal per-flow delay120.532011
  • 1
  • 2