activity
20112022
most citedErgodic Theory Meets Polarization. I: An Ergodic Theory for Binary Operations

24 citations · 92 across the 17 of their papers we have counts for

collaborators
Showing cs.ITShow all

15 papers · 1 filter

cs.IT2022

Age Distribution in Arbitrary Preemptive Memoryless Networks

Rajai Nasser, Ibrahim Issa, Ibrahim Abou-Faycal

We study the probability distribution of age of information (AoI) in arbitrary networks with memoryless service times. A source node generates packets following a Poisson process,…

cs.IT2019

Optimal Age over Erasure Channels

Elie Najm, Emre Telatar, Rajai Nasser

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, give…

cs.IT2018

On the Polarization Levels of Automorphic-Symmetric Channels

Rajai Nasser

It is known that if an Abelian group operation is used in an Arıkan-style construction, we have multilevel polarization where synthetic channels can approach intermediate channels…

cs.IT2018

On the Convergence of the Polarization Process in the Noisiness/Weak- Topology

Rajai Nasser

Let be a channel where the input alphabet is endowed with an Abelian group operation, and let be Arıkan's channel-valued polarization process that is obtained…

cs.IT2018

Content Based Status Updates

Elie Najm, Rajai Nasser, Emre Telatar

Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted t…

cs.IT2017

A Characterization of the Shannon Ordering of Communication Channels

Rajai Nasser

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find a characterization of the Shannon ordering. We show that contains if…

cs.IT2017

On the Input-Degradedness and Input-Equivalence Between Channels

Rajai Nasser

A channel is said to be input-degraded from another channel if can be simulated from by randomization at the input. We provide a necessary and sufficient conditio…

cs.IT2017★ 11 cited

Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs

Rajai Nasser, Joseph M. Renes

We prove polarization theorems for arbitrary classical-quantum (cq) channels. The input alphabet is endowed with an arbitrary Abelian group operation and an Arıkan-style transforma…

cs.IT2017★ 8 cited

Continuity of Channel Parameters and Operations under Various DMC Topologies

Rajai Nasser

We study the continuity of many channel parameters and operations under various topologies on the space of equivalent discrete memoryless channels (DMC). We show that mutual inform…

cs.IT2016★ 14 cited

Age of Information: The Gamma Awakening

Elie Najm, Rajai Nasser

We consider a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly accessible to this monitor. However, we ass…

cs.IT2016★ 1 cited

Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs

Rajai Nasser

We study the performance of generalized polar (GP) codes when they are used for coding schemes involving erasure. GP codes are a family of codes which contains, among others, the s…

cs.IT2015★ 4 cited

Fourier Analysis of MAC Polarization

Rajai Nasser, Emre Telatar

One problem with MAC polar codes that are based on MAC polarization is that they may not achieve the entire capacity region. The reason behind this problem is that MAC polarization…

cs.IT2014★ 20 cited

Ergodic Theory Meets Polarization. II: A Foundation of Polarization Theory

Rajai Nasser

An open problem in polarization theory is to determine the binary operations that always lead to polarization (in the general multilevel sense) when they are used in Arıkan style c…

cs.IT2013★ 1 cited

Polar Codes for Arbitrary DMCs and Arbitrary MACs

Rajai Nasser, Emre Telatar

Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with "usual" polar codes, the block error probabilit…

cs.IT2011★ 4 cited

Polar codes for the m-user multiple access channels

Rajai Nasser

Polar codes are constructed for m-user multiple access channels (MAC) whose input alphabet size is a prime number. The block error probability under successive cancelation decoding…