![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Mostafa Shahabinejad
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Mostafa Shahabinejad, Irina Kezele, Seyed Shahabeddin Nabavi, Wentao Liu, Seel Patel, Yuanhao Yu, Yang Wang, Jin Tang:
Video Action Recognition with Adaptive Zooming Using Motion Residuals. ICCV (Workshops) 2023: 1206-1215 - 2021
- [c6]Mostafa Shahabinejad, Yang Wang, Yuanhao Yu
, Jin Tang, Jiani Li:
Toward Personalized Emotion Recognition: A Face Recognition Based Attention Method for Facial Emotion Recognition. FG 2021: 1-5
2010 – 2019
- 2018
- [j12]Mostafa Shahabinejad
, Majid Khabbazian
, Masoud Ardakani
:
On the Average Locality of Locally Repairable Codes. IEEE Trans. Commun. 66(7): 2773-2783 (2018) - [j11]Mehrtash Mehrabi
, Mostafa Shahabinejad
, Masoud Ardakani
, Majid Khabbazian
:
Improving the Update Complexity of Locally Repairable Codes. IEEE Trans. Commun. 66(9): 3711-3720 (2018) - 2017
- [j10]Faroukh Koroupi, Alireza Morsali
, Vida Niktab, Mostafa Shahabinejad, Siamak Talebi:
Quasi-orthogonal space-frequency and space-time-frequency block codes with modified performance and simplified decoder. IET Commun. 11(11): 1655-1661 (2017) - [c5]Mostafa Shahabinejad, Masoud Ardakani, Majid Khabbazian:
An erasure code with reduced average locality for distributed storage systems. ICNC 2017: 427-431 - [c4]Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
Locally repairable codes with the optimum average information locality. ISIT 2017: 181-185 - [i2]Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
On the Average Locality of Locally Repairable Codes. CoRR abs/1701.06687 (2017) - 2016
- [j9]Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
A Class of Binary Locally Repairable Codes. IEEE Trans. Commun. 64(8): 3182-3193 (2016) - [i1]Mehrtash Mehrabi, Mostafa Shahabinejad, Masoud Ardakani, Majid Khabbazian:
Optimal Locally Repairable Codes with Improved Update Complexity. CoRR abs/1606.09463 (2016) - 2015
- [j8]Adel Ahmadi, Siamak Talebi, Mostafa Shahabinejad:
A New Approach to Fast Decode Quasi-Orthogonal Space-Time Block Codes. IEEE Trans. Wirel. Commun. 14(1): 165-176 (2015) - 2014
- [j7]Mostafa Shahabinejad, Majid Khabbazian, Masoud Ardakani:
An Efficient Binary Locally Repairable Code for Hadoop Distributed File System. IEEE Commun. Lett. 18(8): 1287-1290 (2014) - [j6]Mostafa Shahabinejad, Alireza Morsali
, Siamak Talebi, Mohammad Shahabinejad:
On the coding advantages of the quasi-orthogonal space-frequency block codes. IET Commun. 8(4): 525-529 (2014) - 2013
- [j5]Mostafa Shahabinejad, Siamak Talebi, Mohammad Shahabinejad:
Space-time-frequency coding over quasi-static frequency-selective channels with linear complexity for the ML receiver. Sci. Iran. 20(3): 738-745 (2013) - [j4]Mostafa Shahabinejad, Fatemeh G. Hosseini, Siamak Talebi:
Space-Frequency Codes Based on the Space-Time Codes With Very Low Complexity for the Decoder. IEEE Trans. Veh. Technol. 62(9): 4678-4684 (2013) - 2012
- [j3]Mostafa Shahabinejad, Siamak Talebi:
Full-Diversity Space-Time-Frequency Coding with Very Low Complexity for the ML Decoder. IEEE Commun. Lett. 16(5): 658-661 (2012) - [j2]Zahra Mohammadian, Mostafa Shahabinejad, Siamak Talebi:
New Full-Diversity Space-Frequency Block Codes Based on the OSTBCs. IEEE Commun. Lett. 16(10): 1620-1623 (2012) - [c3]Fatemeh G. Hosseini, Mohammad Shahabinejad, Mostafa Shahabinejad, Siamak Talebi:
Block circular delay diversity space-frequency codes with the enhanced performance. IST 2012: 416-419 - 2011
- [j1]S. Saleh Hosseini Bidaki, Siamak Talebi, Mostafa Shahabinejad:
A Full-Rate Full-Diversity 2x2 Space-Time Block Code with Linear Complexity for the Maximum Likelihood Receiver. IEEE Commun. Lett. 15(8): 842-844 (2011) - [c2]S. Saleh Hosseini Bidaki, Mostafa Shahabinejad:
System performance enhancement for T-code family. SoftCOM 2011: 1-5 - [c1]Mostafa Shahabinejad, Alireza Morsali:
The enhancement of system performance in quasi-orthogonal space-time-frequency codes. SoftCOM 2011: 1-5
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint