![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Ulrich K. Sorger
Person information
- affiliation: University of Luxembourg
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c16]Andrea Capponi
, Piergiorgio Vitello, Claudio Fiandrino
, Guido Cantelmo
, Dzmitry Kliazovich, Ulrich Sorger, Pascal Bouvry
:
Crowdsensed Data Learning-Driven Prediction of Local Businesses Attractiveness in Smart Cities. ISCC 2019: 1-6 - 2018
- [c15]Piergiorgio Vitello, Andrea Capponi
, Claudio Fiandrino
, Paolo Giaccone, Dzmitry Kliazovich, Ulrich Sorger, Pascal Bouvry
:
Collaborative Data Delivery for Smart City-Oriented Mobile Crowdsensing Systems. GLOBECOM 2018: 1-6 - 2017
- [j7]Claudio Fiandrino
, Andrea Capponi
, Giuseppe Cacciatore, Dzmitry Kliazovich, Ulrich Sorger, Pascal Bouvry
, Burak Kantarci
, Fabrizio Granelli
, Stefano Giordano
:
CrowdSenSim: a Simulation Platform for Mobile Crowdsensing in Realistic Urban Environments. IEEE Access 5: 3490-3503 (2017) - 2016
- [c14]Andrea Capponi
, Claudio Fiandrino
, Christian Franck, Ulrich K. Sorger, Dzmitry Kliazovich, Pascal Bouvry
:
Assessing Performance of Internet of Things-Based Mobile Crowdsensing Systems for Sensing as a Service Applications in Smart Cities. CloudCom 2016: 456-459 - [c13]Christian Franck, Uli Sorger:
Some properties of Homogenous Trellis-Constrained Codes. ISTC 2016: 266-270 - [i3]Christian Franck, Uli Sorger:
Untraceable VoIP Communication based on DC-nets. CoRR abs/1610.06549 (2016) - 2010
- [c12]Maria Angeles Jurado Gallardo, Ulrich Sorger:
Multiple decision feedback equalizer for satellite AIS coherent detection. ISCC 2010: 285-290
2000 – 2009
- 2009
- [c11]Volker Fusenig, Eugen Staab, Uli Sorger, Thomas Engel:
Slotted Packet Counting Attacks on Anonymity Protocols. AISC 2009: 53-59 - [c10]Tomasz Ignac, Uli Sorger:
1|Functions on probabilistic graphical models. IMCSIT 2009: 49-56 - [c9]Axel Heim, Ulrich Sorger:
On the convergence of iterative belief propagation. ISIT 2009: 1659-1663 - 2008
- [j6]Axel Heim, Vladimir Sidorenko
, Uli Sorger:
Computation of distributions and their moments in the trellis. Adv. Math. Commun. 2(4): 373-391 (2008) - [c8]Foued Melakessou, Ulrich Sorger, Zdzislaw Suchanecki:
How can path diversity help transmission protocols in the achievement of a better connection QOS? AICCSA 2008: 943-944 - [c7]Axel Heim, Uli Sorger, Florian Hug:
Doppler-variant modeling of the vocal tract. ICASSP 2008: 4197-4200 - [c6]Axel Heim, Vladimir Sidorenko
, Ulrich Sorger:
Computation of Moments in the Trellis. ISIT 2008: 2499-2503 - [c5]Volker Fusenig, Eugen Staab, Uli Sorger, Thomas Engel:
Unlinkable Communication. PST 2008: 51-55 - 2007
- [c4]Foued Melakessou, Ulrich Sorger, Zdzislaw Suchanecki, Charles King:
Route diversity: A future for transmission protocols? BROADNETS 2007: 311-313 - [c3]Foued Melakessou, Ulrich Sorger, Zdzislaw Suchanecki:
On the road towards the comprehension of the internet traffic behavior: simulation and analysis of an end-to-end connection with ns-2. SpringSim (1) 2007: 193-202 - [i2]Uli Sorger:
Discriminated Belief Propagation. CoRR abs/0710.5501 (2007) - [i1]Axel Heim, Vladimir Sidorenko, Uli Sorger:
Trellis Computations. CoRR abs/0711.2873 (2007) - 2000
- [j5]Stefan Brück, Ulrich Sorger, Snjezana Gligorevic, Norbert Stolte:
Interleaving for outer convolutional codes in DS-CDMA systems. IEEE Trans. Commun. 48(7): 1100-1107 (2000)
1990 – 1999
- 1999
- [j4]Michael Schnell, Isabella De Broeck, Uli Sorger:
A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems. Eur. Trans. Telecommun. 10(4): 417-427 (1999) - 1998
- [c2]Uli Sorger, Isabella De Broeck, Michael Schnell:
Interleaved FDMA-a new spread-spectrum multiple-access scheme. ICC 1998: 1013-1017 - 1995
- [b1]Ulrich Sorger:
Reed Solomon Codes und Newton Interpolation. Darmstadt University of Technology, Germany, VDI-Verlag 1995, ISBN 978-3-18-334310-2, pp. 1-68 - [j3]Uwe Dettmar, Ulrich K. Sorger:
Bounded minimum distance decoding of unit memory codes. IEEE Trans. Inf. Theory 41(2): 591-596 (1995) - [j2]Uwe Dettmar, Yan Gao, Ulrich K. Sorger:
Modified generalized concatenated codes and their application to the construction and decoding of LUEP codes. IEEE Trans. Inf. Theory 41(5): 1499-1503 (1995) - 1993
- [j1]Ulrich K. Sorger:
A new Reed-Solomon code decoding algorithm based on Newton's interpolation. IEEE Trans. Inf. Theory 39(2): 358-365 (1993) - [c1]Uwe Dettmar, Ulrich K. Sorger, Victor V. Zyablov:
Concatenated Codes with Convolutional Inner and Outer Codes. Error Control, Cryptology, and Speech Compression 1993: 80-87
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint