default search action
Marwen Zorgui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Roohollah Amiri
, Srinivas Yerramalli
Indoor Environment Learning via RF-Mapping. IEEE J. Sel. Areas Commun. 41(6): 1859-1872 (2023) - 2021
- [i7]Alireza Javani, Marwen Zorgui, Zhiying Wang:
Age of Information for Multiple-Source Multiple-Server Networks. CoRR abs/2106.07247 (2021) - 2020
- [j7]Marwen Zorgui
An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes. IEEE Commun. Lett. 24(9): 1861-1864 (2020) - [c11]Alireza Javani, Marwen Zorgui, Zhiying Wang
On the Age of Information in Erasure Channels with Feedback. ICC 2020: 1-6 - [c10]Alireza Javani, Marwen Zorgui, Zhiying Wang:
Age of Information in Multiple Sensing. ITA 2020: 1-10
2010 – 2019
- 2019
- [j6]Marwen Zorgui
Centralized Multi-Node Repair Regenerating Codes. IEEE Trans. Inf. Theory 65(7): 4180-4206 (2019) - [c9]Alireza Javani, Marwen Zorgui, Zhiying Wang
Age of Information in Multiple Sensing. GLOBECOM 2019: 1-6 - [c8]Marwen Zorgui, Mohammed E. Fouda, Zhiying Wang
Non-Stationary Polar Codes for Resistive Memories. GLOBECOM 2019: 1-6 - [i6]Marwen Zorgui, Mohammed E. Fouda, Zhiying Wang, Ahmed M. Eltawil, Fadi J. Kurdahi:
Non-Stationary Polar Codes for Resistive Memories. CoRR abs/1904.08966 (2019) - [i5]Alireza Javani, Marwen Zorgui, Zhiying Wang:
On the Age of Information in Erasure Channels with Feedback. CoRR abs/1911.05840 (2019) - 2018
- [j5]Marwen Zorgui
Code constructions for multi-node exact repair in distributed storage. Sci. China Inf. Sci. 61(10): 100304:1-100304:18 (2018) - [c7]Marwen Zorgui
On the Achievability Region of Regenerating Codes for Multiple Erasures. ISIT 2018: 2067-2071 - [i4]Marwen Zorgui, Zhiying Wang:
On the Achievability Region of Regenerating Codes for Multiple Erasures. CoRR abs/1802.00104 (2018) - [i3]Marwen Zorgui, Robert Mateescu, Filip Blagojevic, Cyril Guyot, Zhiying Wang:
Storage-Efficient Shared Memory Emulation. CoRR abs/1803.01098 (2018) - 2017
- [j4]Zouheir Rezki
Secret Key Agreement: Fundamental Limits and Practical Challenges. IEEE Wirel. Commun. 24(3): 72-79 (2017) - [c6]Marwen Zorgui
Centralized multi-node repair for minimum storage regenerating codes. ISIT 2017: 2213-2217 - [i2]Marwen Zorgui, Zhiying Wang:
Centralized Multi-Node Repair Regenerating Codes. CoRR abs/1706.05431 (2017) - 2016
- [j3]Marwen Zorgui
Secret-Key Agreement With Public Discussion Subject to an Amplitude Constraint. IEEE Commun. Lett. 20(6): 1124-1127 (2016) - [j2]Marwen Zorgui
On the Ergodic Secret-Key Agreement Over Spatially Correlated Multiple-Antenna Channels With Public Discussion. IEEE Trans. Signal Process. 64(2): 495-510 (2016) - [j1]Marwen Zorgui
The Diversity-Multiplexing Tradeoff of Secret-Key Agreement Over Multiple Antenna Channels. IEEE Trans. Wirel. Commun. 15(2): 1562-1574 (2016) - [c5]Marwen Zorgui
Centralized multi-node repair in distributed storage. Allerton 2016: 617-624 - [i1]Marwen Zorgui
Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint. CoRR abs/1604.00107 (2016) - 2015
- [c4]Marwen Zorgui
Secret-key agreement over spatially correlated multiple-antenna channels in the low-SNR regime. CNS 2015: 719-720 - [c3]Marwen Zorgui
Secret-key agreement over spatially correlated fast-fading multiple-antenna channels with public discussion. ISIT 2015: 2156-2160 - [c2]Marwen Zorgui
On achievable rates of interference and cognitive channels with a relay. PIMRC 2015: 17-22 - 2014
- [c1]Marwen Zorgui
On the diversity-multiplexing tradeoff of secret-key agreement over multiple-antenna channels. Allerton 2014: 175-182
Coauthor Index
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 2025-05-02 23:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: