Search
Selected: A

Achievable Rates and Upper bounds for the Interference Relay Channel

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for a Two-Relay Network with Relays-Transmitter Feedbacks

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for Channels with Deletions and Insertions

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for K-user Gaussian Interference Channels

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for Noisy Channels with Synchronization Errors

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for Pattern Recognition

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for the General Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for the Multiple Access Channel with Feedback and Correlated Sources

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable rates for transmission of discrete constellations over the Gaussian MAC channe

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates for Two-Way Wire-Tap Channels

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates in Two-user Interference Channels with Finite Inputs and (Very) Strong Interference

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Rates over Doubly Selective Rician-Fading Channels under Peak-Power Constraint

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Secrecy Sum-Rate in a Fading MAC-WT with Power Control and without CSI of Eavesdropper

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Sum Rate of MIMO MMSE Recievers: A General Analytic Framework

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achievable Throughput of Multi-mode Multiuser MIMO with Imperfect CSI Constraints

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achieving "Massive MIMO" Spectral Efficiency with a Not-so-Large Number of Antennas

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achieving a vanishing SNR-gap to exact lattice decoding at a subexponential complexity

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achieving Capacity of Bi-Directional Tandem Collision Network by Joint Medium-Access Control and Channel-Network Coding

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Achieving Global Optimality for Weighted Sum-Rate Maximization in the K-User Gaussian Interference Channel with Multiple Antennas

Computer Science – Information Theory
Scientific paper

  [ 0.00 ] – not rated yet Voters 0   Comments 0
  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.