108 citations · 172 across the 14 of their papers we have counts for
Showing 2011 · cs.ITShow all
2 papers · 2 filters
cs.IT2011★ 8 cited
One-Hop Throughput of Wireless Networks with Random Connections
Seyed Pooya Shariatpanahi, Babak Hossein Khalaj, Kasra Alishahi +1
We consider one-hop communication in wireless networks with random connections. In the random connection model, the channel powers between different nodes are drawn from a common d…
cs.IT2011★ 6 cited
Capacity Achieving Linear Codes with Random Binary Sparse Generating Matrices
A. Makhdoumi Kakhaki, H. Karkeh Abadi, P. Pad +3
In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear co…