108 citations · 172 across the 14 of their papers we have counts for
9 papers · 1 filter
Throughput of Large One-hop Wireless Networks with General Fading
Seyed Pooya Shariatpanahi, Babak Hossein Khalaj, Kasra Alishahi +1
Consider source-destination pairs randomly located in a shared wireless medium, resulting in interference between different transmissions. All wireless links are modeled by ind…
Finite-Length Scaling of Polar Codes
S. Hamed Hassani, Kasra Alishahi, Rudiger Urbanke
Consider a binary-input memoryless output-symmetric channel . Such a channel has a capacity, call it , and for any and strictly positive constant we k…
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…
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…
The Enigma of CDMA Revisited
K. Alishahi, S. Dashmiz, P. Pad +3
In this paper, we explore the mystery of synchronous CDMA as applied to wireless and optical communication systems under very general settings for the user symbols and the signatur…
On the scaling of Polar Codes: II. The behavior of un-polarized channels
S. Hamed Hassani, Kasra Alishahi, Rudiger Urbanke
We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes and transmission over the the binary erasure channel. More precisely,…
On the scaling of Polar codes: I. The behavior of polarized channels
S. Hamed Hassani, Rudiger Urbanke
We consider the asymptotic behavior of the polarization process for polar codes when the blocklength tends to infinity. In particular, we study the problem of asymptotic analysis o…
Bounds on the Sum Capacity of Synchronous Binary CDMA Channels
K. Alishahi, F. Marvasti, V. Aref +1
In this paper, we obtain a family of lower bounds for the sum capacity of Code Division Multiple Access (CDMA) channels assuming binary inputs and binary signature codes in the pre…
A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems
P. Pad, F. Marvasti, K. Alishahi +1
In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without…