Complete Characterization of the Equivalent MIMO Channel for Quasi-Orthogonal Space-Time Codes

Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes

Completely Stale Transmitter Channel State Information is Still Very Useful

Completion Time in Broadcast Channel and Interference Channel

Completion Time in Multi-Access Channel: An Information Theoretic Perspective

Completion Time Minimization and Robust Power Control in Wireless Packet Networks

Complex Orthogonal Designs with Forbidden $2 \times 2$ Submatrices

Complex Random Vectors and ICA Models: Identifiability, Uniqueness and Separability

Complex-Valued Random Vectors and Channels: Entropy, Divergence, and Capacity

Complexity Adjusted Soft-Output Sphere Decoding by Adaptive LLR Clipping

Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes

Complexity of Decoding Positive-Rate Reed-Solomon Codes

Complexity of Networks

Complexity of Networks (reprise)

Composite Cyclotomic Fourier Transforms with Reduced Complexities

Compound Multiple Access Channels with Partial Cooperation

Compound Outage Probability and Capacity of a Class of Fading MIMO Channels with Channel Distribution Uncertainty

Compress-and-Forward Performance in Low-SNR Relay Channels

Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows

Compress-Forward without Wyner-Ziv Binning for the One-Way and Two-Way Relay Channels