default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXavier Leturc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c11]Jerzy Lopatka, Tuomas Paso, Raphaël Massin, Xavier Leturc:
Multi band efficient networks for ad hoc communications. ICMCIS 2022: 88-96- [c10]David Jia, Xavier Leturc, Mohamad Assaad, Christophe J. Le Martret:
Rayleigh Channel Statistics Estimation Using SINR Samples Under Single Interfererence. VTC Spring 2022: 1-5 - 2021
- [j4]Jérôme Gaveau, Xavier Leturc
, Christophe J. Le Martret, Mohamad Assaad:
Trial and Error Learning for Dynamic Distributed Channel Allocation in Random Medium. IEEE Trans. Wirel. Commun. 20(12): 8177-8190 (2021) - [c9]Xavier Leturc, Elie Janin, Christophe J. Le Martret:
Distributed Dynamic Channel Assignment in Military Ad Hoc Networks within the MAENA Project: New Algorithm and High Fidelity Simulation Results. MILCOM 2021: 945-950 - 2020
- [j3]Xavier Leturc, Philippe Ciblat, Christophe J. Le Martret:
Estimation of the Ricean K Factor in the Presence of Shadowing. IEEE Commun. Lett. 24(1): 108-112 (2020) - [c8]Xavier Leturc, Christophe J. Le Martret:
Average PER Prediction Based on Statistical CSI for SC-FDE Systems. WiMob 2020: 1-6
2010 – 2019
- 2019
- [j2]Xavier Leturc, Philippe Ciblat, Christophe J. Le Martret:
Energy Efficient Resource Allocation for Type-I HARQ Under the Rician Channel. IEEE Trans. Wirel. Commun. 18(7): 3739-3751 (2019) - 2018
- [b1]Xavier Leturc:
Resource allocation for HARQ in mobile ad hoc networks. (Allocation de ressources pour les HARQ dans les réseaux ad hoc mobiles). University of Paris-Saclay, France, 2018 - [j1]Xavier Leturc, Philippe Ciblat, Christophe J. Le Martret:
Energy-Efficient Resource Allocation for HARQ With Statistical CSI. IEEE Trans. Veh. Technol. 67(12): 11936-11949 (2018) - [c7]Stéphane Imbert, Xavier Leturc, Christophe J. Le Martret:
On the simulation of correlated mobile-to-mobile fading channels for time-varying velocities. ICMCIS 2018: 1-8 - [c6]Xavier Leturc, Christophe J. Le Martret, Philippe Ciblat:
Energy efficient bandwidth and power allocation for type-I HARQ under the Rician channel. ICT 2018: 566-570 - [c5]Xavier Leturc, Philippe Ciblat, Christophe J. Le Martret:
Maximization of the Sum of Energy-Efficiency for Type-I HARQ Under the Rician Channel. SPAWC 2018: 1-5 - 2017
- [c4]Xavier Leturc, Christophe J. Le Martret, Philippe Ciblat:
Energy efficient resource allocation for HARQ with statistical CSI in multiuser ad hoc networks. ICC 2017: 1-6 - [c3]Xavier Leturc, Christophe J. Le Martret, Philippe Ciblat:
Multiuser power and bandwidth allocation in ad hoc networks with Type-I HARQ under Rician channel with statistical CSI. ICMCIS 2017: 1-7 - 2016
- [c2]Xavier Leturc, Philippe Ciblat, Christophe J. Le Martret:
Estimation of the Ricean K-factor from noisy complex channel coefficients. ACSSC 2016: 1092-1096 - [c1]Xavier Leturc, Christophe J. Le Martret, Philippe Ciblat:
Robust spectrum sensing algorithms under noise uncertainty. ICMCIS 2016: 1-7
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 2024-04-25 05:55 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:
