Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Mohammad Rezaeian

dblp:67/4329 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-authorTheory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Information theory · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › network information theory
multiple-access channel		 0.122005
The collision channel with recovery · IEEE Trans. Inf. Theory 2005
Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels · IEEE Trans. Inf. Theory 2004
Information theory › network information theory › multiple-access channel
collision channel		 0.112005
The collision channel with recovery · IEEE Trans. Inf. Theory 2005
Information theory › statistical inference › detection and estimation
multiuser detection		 0.112005
The collision channel with recovery · IEEE Trans. Inf. Theory 2005
Information theory › channel capacity
blahut-arimoto algorithm		 0.012004
Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels · IEEE Trans. Inf. Theory 2004
Information theory
channel capacity		 0.012004
Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels · IEEE Trans. Inf. Theory 2004

Methods — techniques the papers use, named apart from their topics

capacity region derivation · 0.1kuhn-tucker conditions · 0.0
YearPublicationVenuePosition
2010 Constrained multi-object Markov decision scheduling with application to radar resource management
Mohammad Rezaeian, William Moran 0001
 FUSION1
2008 Estimation entropy and its operational characteristics in information acquisition systems
Mohammad Rezaeian
 FUSION1
2006 Symmetric Characterization of Finite State Markov Channels
abstract
In this paper the symmetry property for discrete memoryless channels is generalized to finite state Markov channels. We show that for symmetric Markov channels the noise process can be characterized as a hidden Markov process, and the capacity of channel is related to the entropy rate of this process. These results elaborate the characterization of symmetry for Markov channels in previous narrations and extend the capacity formulae for symmetric discrete memoryless channel to symmetric Markov channels. Using recent formulation of entropy rate of hidden Markov process, this capacity formula is shown to be equivalent to the previous formulations which have been obtained for special cases of symmetric Markov channels
Mohammad Rezaeian
 ISIT1
2005 The collision channel with recovery
abstract
We consider a simple conceptual model of random accessing to a receiver deploying multiuser detection techniques. The model is a simple extension of Massey and Mathys' collision channel without feedback in which a certain probability of recovery from collision is introduced. As the main result, we derive the slot-synchronized capacity region of this recovery channel and show that for sufficiently powerful multiuser detectors, maximal performance is achieved without any sophisticated transmission protocols. We also explore the effect of a simple fading model.
Stéphane Tinguely, Mohammad Rezaeian, Alex J. Grant
 IEEE Trans. Inf. Theory2
2004 A generalization of Arimoto-Blahut algorithm
abstract
The Arimoto-Blahut algorithm is generalized for computation of the total capacity of discrete memoryless multiple access channels. This extension is based on the specialization of the Kuhn-Tucker condition for the total capacity of the multiple access channel, and depends on the result announced by Y. Watanabe et al. (2002) concerning the sufficiency of the Kuhn-Tucker condition.
Mohammad Rezaeian, Alex J. Grant
 ISIT1
2004 Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
abstract
The Arimoto-Blahut (1972) algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MAC). In addition, a class of MAC is defined with the property that the uniform distribution achieves the total capacity. These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known symmetry property for single-user channels.
Mohammad Rezaeian, Alex J. Grant
 IEEE Trans. Inf. Theory1