Morteza Esmaeili
-
- Error Correcting Code Techniques 27
- Cooperative Communication and Network Coding 24
- Artificial Intelligence top 5%
- Coding theory and cryptography 29
- Algorithms and Data Compression 6
- Signal Processing top 10%
-
- Cellular Automata and Applications 8
-
- Advanced Wireless Communication Techniques 19
- graph theory and CDMA systems 14
-
- Advanced Mathematical Theories and Applications 8
- Co-authors
- T. Aaron GulliverMohammad Hesam TadayonMostafa EsmaeiliSafwat A. MahmoudHossein SaidiHamid SheikhzadehH. HaratizadehAli Kakhbod
- Cited by
- Discrete Mathematics and CombinatoricsComputer Networks and CommunicationsArtificial Intelligence
In The Last Decade
Morteza Esmaeili
81 papers receiving 567 citations
Peers
Comparison fields: 5 of 57
- Discrete Mathematics and Combinatorics 41
- Computer Networks and Communications 262
- Artificial Intelligence 266
- Signal Processing 68
- Computational Theory and Mathematics 89
Countries citing papers authored by Morteza Esmaeili
This map shows the geographic impact of Morteza Esmaeili's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Morteza Esmaeili with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Morteza Esmaeili more than expected).
Fields of papers citing papers by Morteza Esmaeili
This network shows the impact of papers produced by Morteza Esmaeili. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Morteza Esmaeili. The network helps show where Morteza Esmaeili may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Morteza Esmaeili, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | 2023 | 2 | |
| 3 | 2022 | 2 | |
| 4 | 2019 | 8 | |
| 5 | 2016 | 16 | |
| 6 | 2014 | 4 | |
| 7 | 2012 | 10 | |
| 8 | 2012 | 17 | |
| 9 | 2010 | 19 | |
| 10 | 2010 | 11 | |
| 11 | Two Classes of Optimal Stopping Redundancy Codes. | 2009 | 1 |
| 12 | 2009 | 48 | |
| 13 | 2009 | 19 | |
| 14 | 2008 | 2 | |
| 15 | 2008 | 1 | |
| 16 | 2008 | 8 | |
| 17 | On the Weakly Superincreasing Distributions and the Fibonacci-Hessenberg Matrices. | 2007 | 8 |
| 18 | On the Quaternary Projection of Binary Linear Block Codes. | 2007 | 1 |
| 19 | 2006 | 2 | |
| 20 | A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords | 2003 | 10 |
About Morteza Esmaeili
Morteza Esmaeili is a scholar working on General Engineering, Computer Networks and Communications and Artificial Intelligence, having authored 85 papers that have together received 608 indexed citations. Recurring topics across this work include Coding theory and cryptography (29 papers), Error Correcting Code Techniques (27 papers), Cooperative Communication and Network Coding (24 papers), Advanced Wireless Communication Techniques (19 papers), graph theory and CDMA systems (14 papers), Advanced Mathematical Theories and Applications (8 papers), Cellular Automata and Applications (8 papers) and Algorithms and Data Compression (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (41 citations), Computer Networks and Communications (262 citations) and Artificial Intelligence (266 citations). Morteza Esmaeili has collaborated with scholars based in Iran, Canada and Sweden. Frequent co-authors include T. Aaron Gulliver, Mohammad Hesam Tadayon, Mostafa Esmaeili, Safwat A. Mahmoud, Hossein Saidi, Hamid Sheikhzadeh, H. Haratizadeh, Ali Kakhbod, Mohammad Reza Gholami and Satoshi Kamiyama. Their work appears in journals such as IEEE Transactions on Information Theory, IEEE Access and IEEE Journal on Selected Areas in Communications.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.