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.

Ghady Azar

dblp:88/11300 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Computer networks · 2 · 1 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
1 paper
Coding theory · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.212015
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory · IEEE Trans. Commun. 2015
Information theory › communication channels › channel models
channels with memory
0.212015
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes
decoding
0.212015
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding
0.212015
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes › decoding
minimum distance decoding
0.112015
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory · IEEE Trans. Commun. 2015

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

syndrome source coding · 0.2maximum-likelihood decoding · 0.2
YearPublicationVenuePosition
2015 On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels With Memory
abstract
We study the optimal maximum likelihood (ML) block decoding of general binary codes sent over two classes of binary additive noise channels with memory. Specifically, we consider the infinite and finite memory Polya contagion and queue-based channel models, which were recently shown to approximate well binary modulated correlated fading channels used with hard-decision demodulation. We establish conditions on the codes and channels parameters under which ML and minimum Hamming distance decoding are equivalent. We also present results on the optimality of classical perfect and quasi-perfect codes when used over the channels under ML decoding. Finally, we briefly apply these results to the dual problem of syndrome source coding with and without side information.
Ghady Azar, Fady Alajaji
IEEE Trans. Commun.1
2011 Modeling Stochastic Correlated Failures and their Effects on Network Reliability
abstract
The physical infrastructure of communication networks is vulnerable to spatially correlated failures arising from various physical stresses such as natural disasters (earthquakes and hurricanes) as well as malicious coordinated attacks using weapons of mass destruction. Some disaster events such as earthquakes and terrorist attacks may occur in more than one location in a short period of time. Hence multiple sets of correlated link failures may occur if more events occurred before the previous set of failed links were repaired. Here, the statistical properties of induced-failure patterns depend upon the spatial interaction among stress centers (e.g., interaction among earthquake or attack locations). This paper presents a stochastic model, based on spatial point processes, for representing stress centers in geographical plane in order to facilitate the modeling of spatially inhomogeneous and correlated link failures in communication networks. This model is then used to further generate scenarios with inhibition or clustering between stress centers, which enables detailed assessment of vulnerabilities of the network to the level of inhomogeneity and spatial correlation in the stress-event centers. Detailed simulation results are presented to compare network reliability for various scenarios of link failures and to find geographically vulnerable areas of a network as well as worst-case scenarios of stress-events. Overall, this effort will provide some critical knowledge and simulation capability for other focus areas of research in network reliability and survivability.
Mahshid Rahnamay-Naeini, Jorge E. Pezoa, Ghady Azar, Nasir Ghani, Majeed M. Hayat
ICCCN3