Personne
Rajai Nasser
Cette personne n’est plus à l’EPFL
Publications associées (22)
Optima Age Over Erasure Channels
Emre Telatar, Elie Najm, 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, given a source that produces a letter every T-s seconds and an erasure channel t ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022Content Based Status Updates
Emre Telatar, Elie Najm, Rajai Nasser
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 through a network to a monitor. However, the transmission policy of each pack ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Optimal Age over Erasure Channels
Emre Telatar, Elie Najm, Rajai Nasser
Given a source that produces a letter every T-s seconds and an erasure channel that can be used every T-c seconds, we ask what is the coding strategy that minimizes the time-average "age of information" that an observer of the channel output incurs. We wil ...
IEEE2019Characterizations of Two Channel Orderings: Input-Degradedness and the Shannon Ordering
The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find characterizations of two orderings: input-degradedness and the Shannon ordering. A channel W is said to be input-degraded from another channel W' if W can ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018Content Based Status Updates
Emre Telatar, Elie Najm, Rajai Nasser
Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on ...
2018Content Based Status Updates
Emre Telatar, Elie Najm, Rajai Nasser
Consider a stream of status updates generated by a source, where each update is of one of two types: priority or ordinary; these updates are to be transmitted through a network to a monitor. We analyze a transmission policy that treats updates depending on ...
IEEE2018Polarization and Channel Ordering: Characterizations and Topological Structures
Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...
EPFL2017On the Input-Degradedness and Input-Equivalence Between Channels
A channel W is said to be input-degraded from another channel W' if W can be simulated from W' by randomization at the input. We provide a necessary and sufficient condition for a channel to be input-degraded from another one. We show that any decoder that ...
2017A Characterization of the Shannon Ordering of Communication Channels
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 W' contains W if and only if W is the skew-composition of W' with a convex-product channel. This ...
2017Topological Structures on DMC spaces
Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet X and output alphabet Y can be naturally endowed with the quotient of the Euclidean topology by the equivalence relation. We s ...
2017