default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan M. Moser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c24]Hui-An Shen
, Stefan M. Moser, Jean-Pascal Pfister:
A Generalization of the Equal Coding Theorem. ITW 2023: 329-334- 2022
- [c23]Shuai Ma, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
Signaling for MISO Channels Under First- and Second-Moment Constraints. ISIT 2022: 2648-2653 - [i8]Hui-An Shen, Stefan M. Moser, Jean-Pascal Pfister:
Rate-Distortion Problems of the Poisson Process based on a Group-Theoretic Approach. CoRR abs/2202.13684 (2022) - 2021
- [c22]Hui-An Shen, Stefan M. Moser, Jean-Pascal Pfister:
Rate-Distortion Problems of the Poisson Process: a Group-Theoretic Approach. ITW 2021: 1-6 - 2020
- [j17]Stefan M. Moser:
Expected Logarithm and Negative Integer Moments of a Noncentral χ2-Distributed Random Variable. Entropy 22(9): 1048 (2020) - [j16]Longguang Li, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
On the Capacity of MIMO Optical Wireless Channels. IEEE Trans. Inf. Theory 66(9): 5660-5682 (2020) - [c21]Hui-An Shen, Stefan M. Moser, Jean-Pascal Pfister:
Sphere Covering for Poisson Processes. ITW 2020: 1-5
2010 – 2019
- 2019
- [c20]Longguang Li, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
On the Capacity of Block Fading Optical Wireless Channels. GLOBECOM 2019: 1-6 - [i7]Longguang Li, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
On the Capacity of MIMO Optical Wireless Channels. CoRR abs/1910.05990 (2019) - 2018
- [j15]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Weak Flip Codes and their Optimality on the Binary Erasure Channel. IEEE Trans. Inf. Theory 64(7): 5191-5218 (2018) - [j14]Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
Capacity Results on Multiple-Input Single-Output Wireless Optical Channels. IEEE Trans. Inf. Theory 64(11): 6954-6966 (2018) - [c19]Longguang Li, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
The MISO free-space optical channel at low and moderate SNR. CISS 2018: 1-6 - [c18]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
The r-wise hamming distance and its operational interpretation for block codes. CISS 2018: 1-6 - [c17]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Connections Between the Error Probability and the r-wise Hamming Distances. ISITA 2018: 130-134 - [c16]Longguang Li, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
On the Capacity of MIMO Optical Wireless Channels. ITW 2018: 1-5 - 2017
- [c15]Stefan M. Moser, Michail Mylonakis, Ligong Wang, Michèle A. Wigger:
Asymptotic capacity results for MIMO wireless optical communication. ISIT 2017: 536-540 - [c14]Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
Asymptotic high-SNR capacity of MISO optical intensity channels. ITW 2017: 86-90 - [i6]Stefan M. Moser, Ligong Wang, Michèle Angela Wigger:
Capacity Results on Multiple-Input Single-Output Wireless Optical Channels. CoRR abs/1710.09177 (2017) - [i5]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Weak Flip Codes and their Optimality on the Binary Erasure Channel. CoRR abs/1711.03310 (2017) - 2016
- [j13]Alexander G. Dimitrov, Faramarz Fekri, Aurel A. Lazar, Stefan M. Moser, Peter J. Thomas:
Guest Editorial Biological Applications of Information Theory in Honor of Claude Shannon's Centennial - Part 1. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 1-4 (2016) - [j12]Alexander G. Dimitrov, Faramarz Fekri, Aurel A. Lazar, Stefan M. Moser, Peter J. Thomas:
Guest Editorial Biological Applications of Information Theory in Honor of Claude Shannon's Centennial - Part II. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(2): 117-119 (2016) - 2015
- [c13]Stanislav Krajci, Chin-Fu Liu, Ladislav Mikes, Stefan M. Moser:
Performance analysis of Fano coding. ISIT 2015: 1746-1750 - [c12]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Nonlinear codes outperform the best linear codes on the binary erasure channel. ISIT 2015: 1751-1755 - 2014
- [j11]Hui Li, Stefan M. Moser, Dongning Guo:
Capacity of the Memoryless Additive Inverse Gaussian Noise Channel. IEEE J. Sel. Areas Commun. 32(12): 2315-2329 (2014) - [j10]Stefan M. Moser:
Impact of Feedback and Side-Information on the Asymptotic Capacity of Single-Input Multiple-Output Fading Channels With Memory. IEEE Trans. Inf. Theory 60(6): 3499-3528 (2014) - 2013
- [j9]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels. IEEE Trans. Inf. Theory 59(11): 7346-7378 (2013) - [c11]Yuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser:
The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback. ISIT 2013: 2269-2273 - [c10]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel. ISIT 2013: 3015-3019 - 2012
- [j8]Stefan M. Moser:
Capacity Results of an Optical Intensity Channel With Input-Dependent Gaussian Noise. IEEE Trans. Inf. Theory 58(1): 207-223 (2012) - [c9]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Weak flip codes and applications to optimal code design on the binary erasure channel. Allerton Conference 2012: 160-167 - [c8]Hui-Ting Chang, Stefan M. Moser:
Bounds on the capacity of the additive inverse Gaussian noise channel. ISIT 2012: 299-303 - [c7]Sue-May Huang, Hsiao-feng Francis Lu, Stefan M. Moser:
Minimal-rate description for multiple-access channels. ISITA 2012: 367-371 - 2011
- [j7]Gu-Rong Lin, Stefan M. Moser:
The Fading Number of a Multiple-Access Rician Fading Channel. IEEE Trans. Inf. Theory 57(8): 4983-4991 (2011) - [c6]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Ultra-small block-codes for binary discrete memoryless channels. ITW 2011: 175-179
2000 – 2009
- 2009
- [j6]Amos Lapidoth, Stefan M. Moser:
On the Capacity of the Discrete-Time Poisson Channel. IEEE Trans. Inf. Theory 55(1): 303-322 (2009) - [j5]Stefan M. Moser:
The fading number of multiple-input multiple-output fading channels with memory. IEEE Trans. Inf. Theory 55(6): 2716-2755 (2009) - [j4]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the capacity of free-space optical intensity channels. IEEE Trans. Inf. Theory 55(10): 4449-4461 (2009) - [i4]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the Capacity of Free-Space Optical Intensity Channels. CoRR abs/0903.1820 (2009) - 2008
- [c5]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the capacity of free-space optical intensity channels. ISIT 2008: 2419-2423 - [i3]Amos Lapidoth, Stefan M. Moser, Michèle A. Wigger:
On the Capacity of Free-Space Optical Intensity Channels. CoRR abs/0805.0521 (2008) - 2007
- [j3]Stefan M. Moser:
The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels. IEEE Trans. Inf. Theory 53(7): 2652-2666 (2007) - [c4]Stefan M. Moser:
The Fading Number of Multiple-Input Multiple-Output Fading Channels with Memory. ISIT 2007: 521-525 - 2006
- [j2]Amos Lapidoth, Stefan M. Moser:
The fading number of single-input multiple-output fading channels with memory. IEEE Trans. Inf. Theory 52(2): 437-453 (2006) - [c3]Stefan M. Moser:
On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory. ISIT 2006: 1056-1060 - [c2]Stefan M. Moser:
Bounds on the fading number of multiple-input single-output fading channels with memory. IWCMC 2006: 3-8 - [i2]Stefan M. Moser:
On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory. CoRR abs/cs/0601022 (2006) - 2005
- [i1]Thomas Zemen, Stefan M. Moser:
Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections. CoRR abs/cs/0505020 (2005) - 2003
- [j1]Amos Lapidoth, Stefan M. Moser:
Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels. IEEE Trans. Inf. Theory 49(10): 2426-2467 (2003) - 2001
- [c1]Amos Lapidoth, Stefan M. Moser:
On the fading number of multi-antenna systems. ITW 2001: 110-111
Coauthor Index
aka: Michèle Angela Wigger
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-03-04 22:10 CET 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:
