Mostafa Monemizadeh

According to our database, Mostafa Monemizadeh authored at least 19 papers between 2009 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2020

Closed-Form Capacity Bounds for the Exponential Version of the Dirty Paper Channel.

Mostafa Monemizadeh, Hamed Fehri

IEEE Wirel. Commun. Lett., 2020

2017

On the Devroye-Mitran-Tarokh and Rini-Tuninetti-Devroye Achievable Rate Regions for the Cognitive Interference Channels.

Mostafa Monemizadeh, Hamed Fehri

IEEE Commun. Lett., 2017

2016

An energy efficient coding scheme for the multiple access relay channel.

Ehsan Moeen Taghavi, Mostafa Monemizadeh, Sajjad Bahrami, Ghosheh Abed Hodtani

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Ergodic capacity of less noisy broadcast channel with channel state available at the receivers.

Sajjad Bahrami, Mostafa Monemizadeh, Ehsan Moeen Taghavi, Ghosheh Abed Hodtani

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

2015

Comments on "Achievable Rates in Cognitive Radio Channels".

Mostafa Monemizadeh

CoRR, 2015

Joint source-channel coding for broadcast channel with cooperating receivers.

Sajjad Bahrami, Behrooz Razeghi, Mostafa Monemizadeh, Ghosheh Abed Hodtani

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014

Gaussian doubly dirty compound multiple-access channel with partial side information at the transmitters.

Mostafa Monemizadeh, Elham Bahmani, Ghosheh Abed Hodtani, Seyed Alireza Seyedin

IET Commun., 2014

Two-way writing on dirty paper in the presence of noise-dependent interference.

Narges Monemizadeh, Mostafa Monemizadeh, Ghosheh Abed Hodtani

Proceedings of the Iran Workshop on Communication and Information Theory, 2014

State-dependent Z channel.

Saeed Hajizadeh, Mostafa Monemizadeh, Elham Bahmani

Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014

2013

Cognitive Radio Channels with Arbitrarily Correlated Sources.

Mostafa Monemizadeh, Ghosheh Abed Hodtani, Seyed Alireza Seyedin

IEEE Commun. Lett., 2013

State-Dependent Z Channel

Saeed Hajizadeh, Mostafa Monemizadeh, Elham Bahmani, Ghosheh Abed Hodtani, Mohsen Joneidi

CoRR, 2013

Interference channel with common message and Slepian-Wolf channel state information.

Mostafa Monemizadeh, Ghosheh Abed Hodtani, Saeed Hajizadeh, Seyed Alireza Seyedin

Proceedings of the Iran Workshop on Communication and Information Theory, 2013

An achievable rate region for interfering multiple access channel and broadcast channel with a cognitive transmitter.

Hamed Fehri, Hossein Khoshbin, Ghosheh Abed Hodtani, Mostafa Monemizadeh

Proceedings of the Iran Workshop on Communication and Information Theory, 2013

2012

Capacity Bounds for Dirty Paper with Exponential Dirt

Mostafa Monemizadeh, Saeed Hajizadeh, Ghosheh Abed Hodtani, Seyed Alireza Seyedin

CoRR, 2012

Achievable rate regions for compound multiple access channel with channel state information.

Mostafa Monemizadeh, Ghosheh Abed Hodtani

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Compound Multiple Access Channel with common message and intersymbol interference.

Mostafa Monemizadeh, Seyed Alireza Seyedin, Ghosheh Abed Hodtani, Saeed Hajizadeh

Proceedings of the 6th International Symposium on Telecommunications, 2012

A coding theorem for the discrete memoryless compound multiple access channel with common message and generalized feedback.

Saeed Hajizadeh, Mostafa Monemizadeh, Ghosheh Abed Hodtani

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

An Achievable Rate Region for Cognitive Radio Channel With Common Message

Mostafa Monemizadeh, Ghosheh Abed Hodtani, Hamed Fehri

CoRR, 2011

2009

Optimal DWT-SVD Domain Image Watermarking Using Multi-objective Evolutionary Algorithms.

Mostafa Monemizadeh, Seyed Alireza Seyedin

Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009