PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Moser, Stefan M."

Author of the publication

copydeleteadd this publication to your clipboard
The r-wise hamming distance and its operational interpretation for block codes.

, , and . CISS, page 1-6. IEEE, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Moser University of Stuttgart

David Moser University of Stuttgart

M. Nudischer

M. Kratzer

M. Liewald

 

Other publications of authors with the same name

The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback., , and . ISIT, page 2269-2273. IEEE, (2013)Impact of Feedback and Side-Information on the Asymptotic Capacity of Single-Input Multiple-Output Fading Channels With Memory.. IEEE Trans. Information Theory, 60 (6): 3499-3528 (2014)Ultra-small block-codes for binary discrete memoryless channels., , and . ITW, page 175-179. IEEE, (2011)Weak flip codes and applications to optimal code design on the binary erasure channel., , and . Allerton Conference, page 160-167. IEEE, (2012)Nonlinear codes outperform the best linear codes on the binary erasure channel., , and . ISIT, page 1751-1755. IEEE, (2015)Connections Between the Error Probability and the r-wise Hamming Distances., , and . ISITA, page 130-134. IEEE, (2018)Capacity of the Memoryless Additive Inverse Gaussian Noise Channel., , and . IEEE Journal on Selected Areas in Communications, 32 (12): 2315-2329 (2014)Capacity Results of an Optical Intensity Channel With Input-Dependent Gaussian Noise.. IEEE Trans. Information Theory, 58 (1): 207-223 (2012)On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory.. ISIT, page 1056-1060. IEEE, (2006)Weak Flip Codes and their Optimality on the Binary Erasure Channel., , and . IEEE Trans. Information Theory, 64 (7): 5191-5218 (2018)