Остановите войну!
for scientists:
default search action
Joseph Jean Boutros
- > Home > Persons > Joseph Jean Boutros
Publications
- 2018
- [j35]Johannes Van Wonterghem, Amira Alloum, Joseph Jean Boutros, Marc Moeneclaey:
On short-length error-correcting codes for 5G-NR. Ad Hoc Networks 79: 53-62 (2018) - [j34]Johannes Van Wonterghem, Joseph J. Boutros, Marc Moeneclaey:
On Constructions of Reed-Muller Subcodes. IEEE Commun. Lett. 22(2): 220-223 (2018) - 2016
- [c58]Johannes Van Wonterghem, Amira Alloum, Joseph Jean Boutros, Marc Moeneclaey:
Performance comparison of short-length error-correcting codes. SCVT 2016: 1-6 - [i15]Johannes Van Wonterghem, Amira Alloum, Joseph Jean Boutros, Marc Moeneclaey:
Performance Comparison of Short-Length Error-Correcting Codes. CoRR abs/1609.07907 (2016) - 2013
- [j29]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Precoding for Outage Probability Minimization on Block Fading Channels. IEEE Trans. Inf. Theory 59(12): 8250-8266 (2013) - 2012
- [j28]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Precoding for Word Error Rate Minimization of LDPC Coded Modulation on Block Fading Channels. IEEE Trans. Wirel. Commun. 11(7): 2457-2467 (2012) - [c41]Dieter Duyck, Sheng Yang, Fambirai Takawira, Joseph Jean Boutros, Marc Moeneclaey:
Time-varying space-only code: A new paradigm for coded MIMO communication. ISCCSP 2012: 1-4 - [c40]Dieter Duyck, Marc Moeneclaey, Sheng Yang, Fambirai Takawira, Joseph Jean Boutros:
Time-varying space-only codes. ISIT 2012: 2821-2825 - [i10]Dieter Duyck, Sheng Yang, Fambirai Takawira, Joseph Jean Boutros, Marc Moeneclaey:
Time-Varying Space-Only Codes for Coded MIMO. CoRR abs/1205.0699 (2012) - 2011
- [j27]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Stability Outage Analysis for LDPC Codes. IEEE Commun. Lett. 15(11): 1231-1233 (2011) - [j26]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Low-Density Graph Codes for Coded Cooperation on Slow Fading Relay Channels. IEEE Trans. Inf. Theory 57(7): 4202-4218 (2011) - [c37]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Precoding for coded communication on block fading channels and cooperative communications. ITW 2011: 355-359 - [c36]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Full diversity random LDPC codes. SCVT 2011: 1-6 - [i9]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Precoding for Outage Probability Minimization on Block Fading Channels. CoRR abs/1103.5348 (2011) - 2010
- [j24]Dieter Duyck, Daniele Capirone, Joseph Jean Boutros, Marc Moeneclaey:
Analysis and Construction of Full-Diversity Joint Network-LDPC Codes for Cooperative Communications. EURASIP J. Wirel. Commun. Netw. 2010 (2010) - [c34]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Rotated modulations for outage probability minimization: a fading space approach. ISIT 2010: 1061-1065 - 2009
- [c30]Dieter Duyck, Daniele Capirone, Marc Moeneclaey, Joseph Jean Boutros:
A full-diversity joint network-channel code construction for cooperative communications. PIMRC 2009: 1282-1286 - [i5]Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Low-Density Graph Codes for slow fading Relay Channels. CoRR abs/0903.1502 (2009)
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-25 01:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint