#### Filter Results:

- Full text PDF available (94)

#### Publication Year

2003

2017

- This year (3)
- Last 5 years (45)
- Last 10 years (101)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The use of random linear network coding (NC) has significantly simplified the design of opportunistic routing (OR) protocols by removing the need of coordination among forwarding nodes for avoiding duplicate transmissions. However, NC-based OR protocols face a new challenge: How many coded packets should each forwarder transmit? To avoid the overhead of… (More)

- Dongning Guo, Chih-Chun Wang
- IEEE Journal on Selected Areas in Communications
- 2008

Code-division multiple access (CDMA) is the basis of a family of advanced air interfaces in current and future generation networks. The benefits promised by CDMA have not been fully realized partly due to the prohibitive complexity of optimal detection and decoding of many users communicating simultaneously using the same frequency band. From both… (More)

- Dimitrios Koutsonikolas, Y. Charlie Hu, Chih-Chun Wang
- INFOCOM
- 2009

In contrast to unicast routing, high-throughput reliable multicast routing in wireless mesh networks (WMNs) has received little attention. There are two primary challenges to supporting high-throughput, reliable multicast in WMNs. The first is no different from unicast: Wireless links are inherently lossy due to varying channel conditions and interference.… (More)

- Dongning Guo, Chih-Chun Wang
- 2006 IEEE Information Theory Workshop - ITW '06…
- 2006

This paper studies the estimation of a high-dimensional vector signal where the observation is a known "sparse" linear transformation of the signal corrupted by additive Gaussian noise. A paradigm of such a linear system is code-division multiple access (CDMA) channel with sparse spreading matrix. Assuming a "semi-regular" ensemble of sparse matrix linear… (More)

- Dongning Guo, Chih-Chun Wang
- 2007 IEEE International Symposium on Information…
- 2007

This paper studies the problem of estimating the vector input to a sparse linear transformation based on the observation of the output vector through a bank of arbitrary independent channels. The linear transformation is drawn randomly from an ensemble with mild regularity conditions. The central result is a decoupling principle in the large-system limit.… (More)

- Sarah H. Sellke, Chih-Chun Wang, Saurabh Bagchi, Ness B. Shroff
- INFOCOM
- 2009

There has been significant recent interest in covert communication using timing channels. In network timing channels, information is leaked by controlling the time between transmissions of consecutive packets. Our work focuses on network timing channels and provides two main contributions. The first is to quantify the threat posed by covert network timing… (More)

- Chih-Chun Wang
- IEEE Transactions on Information Theory
- 2012

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), a generalization of the broadcast binary erasure channel from the binary symbol to a finite field G F(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each transmission. The main results… (More)

- Chih-Chun Wang, Ness B. Shroff
- IEEE Transactions on Information Theory
- 2010

When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow theorem. For the case of more than one coexisting sessions, network coding also demonstrates throughput improvement over noncoded solutions. This paper proposes pairwise… (More)

- Chih-Chun Wang
- 2010 48th Annual Allerton Conference on…
- 2010

This paper focuses on the 1-to-K broadcast packet erasure channel (PEC), which is a generalization of the broadcast binary erasure channel from the binary symbol to that of arbitrary finite fields GF(q) with sufficiently large q. We consider the setting in which the source node has instant feedback of the channel outputs of the K receivers after each… (More)

- Gyu Bum Kyung, Chih-Chun Wang
- 2010 IEEE International Symposium on Information…
- 2010

This work provides an exhaustive search algorithm for finding small fully absorbing sets (FASs) of arbitrary low-density parity-check (LDPC) codes. In particular, given any LDPC code, the problem of finding all FASs of size less than t is formulated as an integer programming problem, for which a new branch-&-bound algorithm is devised. New node… (More)