11 citations
- Institut Polytechnique de ParisFR2 papers
- Laboratoire Traitement et Communication de l’InformationFR2 papers
- Technical University of MunichDE2 papers
- Arts et MétiersFR1 paper
- Centrale MéditerranéeFR1 paper
- Centre d'Etudes et de Recherche en Gestion d'Aix-MarseilleFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Château GombertFR1 paper
- China Mobile (China)CN1 paper
- EURECOMFR1 paper
- HEC MontréalCA1 paper
- IMT AtlantiqueFR1 paper
12 papers · 1 filter
Coding for Sensing: An Improved Scheme for Integrated Sensing and Communication over MACs
Mehrasa Ahmadipour, Michele Wigger, Mari Kobayashi
A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (es…
First- and Second-Moment Constrained Gaussian Channels
Shuai Ma, Michèle Wigger
This paper studies the channel capacity of intensity-modulation direct-detection (IM/DD) visible light communication (VLC) systems under both optical and electrical power constrain…
A Rate-Distortion Approach to Caching
Roy Timo, Shirin Saeedi Bidokhti, Michèle Wigger +1
This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal…
The Shannon's mutual information of a multiple antenna time and frequency dependent channel: an ergodic operator approach
Walid Hachem, Aris Moustakas, Leonid Pastur
Consider a random non-centered multiple antenna radio transmission channel. Assume that the deterministic part of the channel is itself frequency selective, and that the random mul…
Efficient Decoding Algorithms for the Compute-and-Forward Strategy
Asma Mejri, Ghaya Rekaya-Ben Othman
We address in this paper decoding aspects of the Compute-and-Forward (CF) physical-layer network coding strategy. It is known that the original decoder for the CF is asymptotically…
Lower bounds on the minimum distance of long codes in the Lee metric
Hugues Randriam, Lin Sok, Patrick Solé
The Gilbert type bound for codes in the title is reviewed, both for small and large alphabets. Constructive lower bounds better than these existential bounds are derived from geome…