Chih-Chun Wang

Affiliations:
  • Purdue University, West Lafayette, USA


According to our database1, Chih-Chun Wang authored at least 106 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Unifying AoI Minimization and Remote Estimation - Optimal Sensor/Controller Coordination With Random Two-Way Delay.
IEEE/ACM Trans. Netw., 2022

Causal Adversarial Channels With Feedback Snooping.
IEEE J. Sel. Areas Inf. Theory, 2022

Channel Capacity for Adversaries with Computationally Bounded Observations.
CoRR, 2022

2021
Optimal finite-length linear codes and the corresponding channel dispersion for broadcast packet erasure channels with feedback.
Proceedings of the IEEE Information Theory Workshop, 2021

Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On finite-length analysis and channel dispersion for broadcast packet erasure channels with feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
A New Capacity-Approaching Scheme for General 1-to-K Broadcast Packet Erasure Channels With ACK/NACK.
IEEE Trans. Inf. Theory, 2020

Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime.
Proceedings of the IEEE International Symposium on Information Theory, 2020

On Coded Caching for Two Users with Overlapping Demand Sets.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

Backhauling Many Devices: Relay Schemes for Massive Random Access Networks.
Proceedings of the IEEE Global Communications Conference, 2020

2019
Closing the Gap for Coded Caching with Distinct File Sizes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Optimal Delay Amplification Factor of Multi-Hop Relay Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Coded Caching with Full Heterogeneity: Exact Capacity of The Two-User/Two-File Case.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Coded Caching with Heterogeneous File Demand Sets - The Insufficiency of Selfish Coded Caching.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
The Two-Unicast Problem.
IEEE Trans. Inf. Theory, 2018

Locally Repairable Regenerating Codes: Node Unavailability and the Insufficiency of Stationary Local Repair.
IEEE Trans. Inf. Theory, 2018

When Can Intelligent Helper Node Selection Improve the Performance of Distributed Storage Networks?
IEEE Trans. Inf. Theory, 2018

On The Rate-Cost of Gaussian Linear Control Systems with Random Communication Delays.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Flexible Fractional Repetition Codes for Distributed Storage Networks.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Inter-Session Network Coding Schemes for 1-to-2 Downlink Access-Point Networks With Sequential Hard Deadline Constraints.
IEEE/ACM Trans. Netw., 2017

Robust and Optimal Opportunistic Scheduling for Downlink Two-Flow Network Coding With Varying Channel Quality and Rate Adaptation.
IEEE/ACM Trans. Netw., 2017

Timely Wireless Flows With General Traffic Patterns: Capacity Region and Scheduling Algorithms.
IEEE/ACM Trans. Netw., 2017

Sending Perishable Information: Coding Improves Delay-Constrained Throughput Even for Single Unicast.
IEEE Trans. Inf. Theory, 2017

A new capacity-approaching protocol for general 1-to-K broadcast packet erasure channels with ACK/NACK.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Transcoding: A new strategy for relay channels.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Toward Optimal Distributed Monitoring of Multi-Channel Wireless Networks.
IEEE Trans. Mob. Comput., 2016

General Capacity Region for the Fully Connected Three-Node Packet Erasure Network.
IEEE Trans. Inf. Theory, 2016

Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures).
CoRR, 2016

Locally Repairable Regenerating Code Constructions.
CoRR, 2016

When Can Helper Node Selection Improve Regenerating Codes? Part I: Graph-Based Analysis.
CoRR, 2016

When Can Helper Node Selection Improve Regenerating Codes? Part II: An Explicit Exact-Repair Code Construction.
CoRR, 2016

Delay-constrained capacity for broadcast erasure channels: A linear-coding-based study.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Linear network coding capacity region of the smart repeater with broadcast erasure channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On coding capacity of delay-constrained network information flow: An algebraic approach.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Timely wireless flows with arbitrary traffic patterns: Capacity region and scheduling algorithms.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback.
IEEE Trans. Commun., 2015

Coded caching for files with distinct file sizes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

General capacity region for the fully-connected 3-node packet erasure network.
Proceedings of the IEEE International Symposium on Information Theory, 2015

When locally repairable codes meet regenerating codes - What if some helpers are unavailable.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback.
IEEE Trans. Inf. Theory, 2014

Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation.
CoRR, 2014

Two-unicast is hard.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

When and by how much can helper node selection improve regenerating codes?
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
A Low-Complexity Congestion Control and Scheduling Algorithm for Multihop Wireless Networks With Order-Optimal Per-Flow Delay.
IEEE/ACM Trans. Netw., 2013

Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels.
IEEE Trans. Inf. Theory, 2013

Graph-Theoretic Characterization of The Feasibility of The Precoding-Based 3-Unicast Interference Alignment Scheme
CoRR, 2013

Gibbs-sampling-based optimization for the deployment of small cells in 3G heterogeneous networks.
Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

Toward optimal sniffer-channel assignment for reliable monitoring in multi-channel wireless networks.
Proceedings of the 10th Annual IEEE International Conference on Sensing, 2013

Linear network coding capacity for broadcast erasure channels with feedback, receiver coordination, and arbitrary security requirement.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Pacifier: High-Throughput, Reliable Multicast Without "Crying Babies" in Wireless Mesh Networks.
IEEE/ACM Trans. Netw., 2012

On the Capacity of Wireless 1-Hop Intersession Network Coding - A Broadcast Packet Erasure Channel Approach.
IEEE Trans. Inf. Theory, 2012

On the Capacity of 1-to-K Broadcast Packet Erasure Channels With Channel Output Feedback.
IEEE Trans. Inf. Theory, 2012

Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder.
IEEE Trans. Commun., 2012

Fast rendezvous for multiple clients for cognitive radios using coordinated channel hopping.
Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, 2012

Capacity region of two symmetric nearby erasure channels with channel state feedback.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Linear network coding capacity region of 2-receiver MIMO broadcast packet erasure channels with feedback.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Distributed online channel assignment toward optimal monitoring in multi-channel wireless networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

On the error-prone substructures for the binary-input ternary-output channel and its corresponding exhaustive search algorithm.
Proceedings of IEEE International Conference on Communications, 2012

2011
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments.
IEEE/ACM Trans. Netw., 2011

Toward a Practical Scheme for Binary Broadcast Channels with Varying Channel Quality Using Dirty Paper Coding.
IEEE Trans. Commun., 2011

FEC-based AP downlink transmission schemes for multiple flows: Combining the reliability and throughput enhancement of intra- and inter-flow coding.
Perform. Evaluation, 2011

On The Capacity of Immediately-Decodable Coding Schemes for Wireless Stored-Video Broadcast with Hard Deadline Constraints.
IEEE J. Sel. Areas Commun., 2011

The impact of inter-layer network coding on the relative performance of MRC/MDC WiFi media delivery.
Proceedings of the Network and Operating System Support for Digital Audio and Video, 2011

Common information of random linear network coding over a 1-hop broadcast packet erasure channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the capacity of 2-user 1-hop relay erasure networks - The union of feedback, scheduling, opportunistic routing, and network coding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Efficient Online WiFi Delivery of Layered-Coding Media Using Inter-layer Network Coding.
Proceedings of the 2011 International Conference on Distributed Computing Systems, 2011

Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Analysis of precoding-based intersession network coding and the corresponding 3-unicast interference alignment scheme.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Rate Control With Pairwise Intersession Network Coding.
IEEE/ACM Trans. Netw., 2010

Pairwise intersession network coding on directed networks.
IEEE Trans. Inf. Theory, 2010

Pruning network coding traffic by network coding: a new class of max-flow algorithms.
IEEE Trans. Inf. Theory, 2010

Designing coded feedback for efficient network coding based opportunistic routing.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2010

Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version)
CoRR, 2010

Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Finding all small error-prone substructures in LDPC codes.
IEEE Trans. Inf. Theory, 2009

Cross-layer optimization for wireless multihop networks with pairwise intersession network coding.
IEEE J. Sel. Areas Commun., 2009

On the designs and challenges of practical binary dirty paper coding.
Proceedings of the 2009 IEEE Wireless Communications and Networking Conference, 2009

Fast Resource Allocation for Network-Coded Traffic - A Coded-Feedback Approach.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

TCP/IP Timing Channels: Theory to Implementation.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

An Empirical Study of Performance Benefits of Network Coding in Multihop Wireless Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Multiuser Detection of Sparsely Spread CDMA.
IEEE J. Sel. Areas Commun., 2008

Pruning network coding traffic by network coding - A new max-flow algorithm.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Optimization Based Rate Control for Communication Networks with Inter-Session Network Coding.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

High-throughput, reliable multicast without "crying babies" in wireless mesh networks.
Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, 2008

On wireless network scheduling with intersession network coding.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007
Finite-Dimensional Bounds on BBZ<sub>m</sub> and Binary LDPC Codes With Belief Propagation Decoders.
IEEE Trans. Inf. Theory, 2007

Capacity regions for multiple unicast flows using inter-session network coding.
Proceedings of the 3rd International ICSTConference on Wireless Internet, 2007

Beyond the Butterfly - A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast Sessions.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On the Exhaustion and Elimination of Trapping Sets: Algorithms & The Suppressing Effect.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Capacity Bounds on Timing Channels with Bounded Service Times.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Random Sparse Linear Systems Observed Via Arbitrary Channels: A Decoupling Principle.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Function-Level Multitasking Interface Design in an Embedded Operating System with Reconfigurable Hardware.
Proceedings of the Embedded and Ubiquitous Computing, International Conference, 2007

2006
Finite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders
CoRR, 2006

Exhausting Error-Prone Patterns in LDPC Codes
CoRR, 2006

Code Annealing and the Suppressing Effect of the Cyclically Lifted LDPC Code Ensemble
CoRR, 2006

Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Density evolution for asymmetric memoryless channels.
IEEE Trans. Inf. Theory, 2005

Bandit problems with side observations.
IEEE Trans. Autom. Control., 2005

On the Typicality of the Linear Code Among the LDPC Coset Code Ensemble
CoRR, 2005

Arbitrary side observations in bandit problems.
Adv. Appl. Math., 2005

2003
Bandit problems with arbitrary side observations.
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003


  Loading...