![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Saeedeh Moloudi
Person information
Refine list
![note](https://dblp1.uni-trier.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
- [c10]Saeedeh Moloudi, Mohammad Mozaffari, Kittipong Kittichokechai, Andreas Höglund, Sandeep Narayanan Kadan Veedu, Y.-P. Eric Wang, Johan Bergman:
5G Reduced Capability Devices: Analysis of Blocking Probability for Control Channels. WCNC 2023: 1-6 - 2021
- [j3]Saeedeh Moloudi
, Mohammad Mozaffari, Sandeep Narayanan Kadan Veedu, Kittipong Kittichokechai, Y.-P. Eric Wang, Johan Bergman, Andreas Höglund
:
Coverage Evaluation for 5G Reduced Capability New Radio (NR-RedCap). IEEE Access 9: 45055-45067 (2021) - [c9]Ranjitha Gubbi Suresh, Leif R. Wilhelmsson, Saeedeh Moloudi, Michael Lentmaier:
Opportunistic Multi-Layer Transmission over Unknown Channels. VTC Spring 2021: 1-6 - [i11]Saeedeh Moloudi, Mohammad Mozaffari, Sandeep Narayanan Kadan Veedu, Kittipong Kittichokechai, Y.-P. Eric Wang, Johan Bergman, Andreas Höglund:
Coverage Evaluation for 5G Reduced Capability New Radio (NR-RedCap). CoRR abs/2101.07310 (2021) - 2020
- [c8]Muhammad Umar Farooq
, Saeedeh Moloudi, Michael Lentmaier:
Generalized LDPC Codes with Convolutional Code Constraints. ISIT 2020: 479-484 - [i10]Muhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier:
Generalized LDPC Codes with Convolutional Code Constraints. CoRR abs/2002.05633 (2020)
2010 – 2019
- 2019
- [j2]Saeedeh Moloudi
, Michael Lentmaier, Alexandre Graell i Amat
:
Spatially Coupled Turbo-Like Codes: A New Trade-Off Between Waterfall and Error Floor. IEEE Trans. Commun. 67(5): 3114-3123 (2019) - 2018
- [b1]Saeedeh Moloudi:
Spatially Coupled Turbo-Like Codes. Lund University, Sweden, 2018 - [c7]Muhammad Umar Farooq
, Saeedeh Moloudi, Michael Lentmaier:
Thresholds of Braided Convolutional Codes on the AWGN Channel. ISIT 2018: 1375-1379 - [i9]Muhammad Umar Farooq, Saeedeh Moloudi, Michael Lentmaier:
Thresholds of Braided Convolutional Codes on the AWGN Channel. CoRR abs/1802.10540 (2018) - [i8]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Spatially coupled turbo-like codes: a new trade-off between waterfall and error floor. CoRR abs/1804.01706 (2018) - 2017
- [j1]Saeedeh Moloudi
, Michael Lentmaier, Alexandre Graell i Amat
:
Spatially Coupled Turbo-Like Codes. IEEE Trans. Inf. Theory 63(10): 6199-6215 (2017) - [c6]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat
:
A unified ensemble of concatenated convolutional codes. ISIT 2017: 26-30 - [i7]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
A Unified Ensemble of Concatenated Convolutional Codes. CoRR abs/1703.08784 (2017) - 2016
- [c5]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Finite length weight enumerator analysis of braided convolutional codes. ISITA 2016: 488-492 - [i6]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Spatially Coupled Turbo-Like Codes. CoRR abs/1604.07315 (2016) - [i5]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Finite Length Weight Enumerator Analysis of Braided Convolutional Codes. CoRR abs/1608.02355 (2016) - 2015
- [c4]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat
:
Threshold saturation for spatially coupled turbo-like codes over the binary erasure channel. ITW Fall 2015: 138-142 - [i4]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Threshold Saturation for Spatially Coupled Turbo-like Codes over the Binary Erasure Channel. CoRR abs/1508.02196 (2015) - 2014
- [c3]Saeedeh Moloudi, Michael Lentmaier:
Density evolution analysis of braided convolutional codes on the erasure channel. ISIT 2014: 2609-2613 - [c2]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat
:
Spatially coupled turbo codes. ISTC 2014: 82-86 - [c1]Alexandre Graell i Amat
, Saeedeh Moloudi, Michael Lentmaier:
Spatially coupled turbo codes: Principles and finite length performance. ISWCS 2014: 883-887 - [i3]Saeedeh Moloudi, Michael Lentmaier, Alexandre Graell i Amat:
Spatially Coupled Turbo Codes. CoRR abs/1404.2393 (2014) - [i2]Michael Lentmaier, Saeedeh Moloudi, Alexandre Graell i Amat:
Braided Convolutional Codes - A Class of Spatially Coupled Turbo-Like Codes. CoRR abs/1407.0511 (2014) - [i1]Alexandre Graell i Amat, Saeedeh Moloudi, Michael Lentmaier:
Spatially Coupled Turbo Codes: Principles and Finite Length Performance. CoRR abs/1407.0516 (2014)
Coauthor Index
![](https://dblp1.uni-trier.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-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint