887 citations
- Université Paris-SaclayFR9 papers
- Télécom ParisFR7 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- CentraleSupélecFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- University of PisaIT4 papers
- Laboratoire Traitement et Communication de l’InformationFR3 papers
- Linköping UniversitySE3 papers
- Living Independently Now CenterUS3 papers
- National Research CouncilLK3 papers
- Safran (France)FR3 papers
- Sorbonne UniversitéFR3 papers
8 papers · 1 filter
Pilot Contamination is Not a Fundamental Asymptotic Limitation in Massive MIMO
Emil Björnson, Jakob Hoydis, Luca Sanguinetti
Massive MIMO (multiple-input multiple-output) provides great improvements in spectral efficiency over legacy cellular networks, by coherent combining of the signals over a large an…
On locality of Generalized Reed-Muller codes over the broadcast erasure channel
Amira Alloum, Sian-Jheng Lin, Tareq Y. Al-Naffouri
One to Many communications are expected to be among the killer applications for the currently discussed 5G standard. The usage of coding mechanisms is impacting broadcasting standa…
Advertising Competitions in Social Networks
Antonia Masucci, Alonso Silva
In the present work, we study the advertising competition of several marketing campaigns who need to determine how many resources to allocate to potential customers to advertise th…
Performance Prediction of Nonbinary Forward Error Correction in Optical Transmission Experiments
Laurent Schmalen, Alex Alvarado, Rafael Rios-Müller
In this paper, we compare different metrics to predict the error rate of optical systems based on nonbinary forward error correction (FEC). It is shown that the correct metric to p…
Analytic combinatorics of connected graphs
Elie de Panafieu
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound…
Balanced Fair Resource Sharing in Computer Clusters
Thomas Bonald, Céline Comte
We represent a computer cluster as a multi-server queue with some arbitrary bipartite graph of compatibilities between jobs and servers. Each server processes its jobs sequentially…