The Benefit of Thresholding in LP Decoding of LDPC Codes
The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
The Berlekamp-Massey Algorithm via Minimal Polynomials
The best possible upper bound on the probability of undetected error for linear codes of full support
The Bethe Permanent of a Non-Negative Matrix
The Binary-Symmetric Parallel-Relay Network
The Burbea-Rao and Bhattacharyya centroids
The capacity for the linear time-invariant Gaussian relay channel
The capacity of a class of 3-receiver broadcast channels with degraded message sets
The Capacity of a Class of Linear Deterministic Networks
The Capacity of a Class of Multi-Way Relay Channels
The Capacity of Ad hoc Networks under Random Packet Losses
The Capacity of Channels with Feedback
The Capacity of Finite-State Channels in the High-Noise Regime
The Capacity of MIMO Channels with Per-Antenna Power Constraint
The Capacity of Random Ad hoc Networks under a Realistic Link Layer Model
The Capacity of Random Linear Coding Networks as Subspace Channels
The Capacity of the Interference Channel with a Cognitive Relay in Very Strong Interference
The Capacity of the Semi-Deterministic Cognitive Interference Channel and its Application to Constant Gap Results for the Gaussian Channel
The Capacity of the Semi-Deterministic Cognitive Interference Channel with a Common Cognitive Message and Approximate Capacity for the Gaussian Case