Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tobias Monsees

dblp:254/5713 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0003-3650-3569ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 91% Information theory · 9%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › rate-distortion theory
information bottleneck
0.412020
Forward-Aware Information Bottleneck-Based Vector Quantization for Noisy Channels · IEEE Trans. Commun. 2020
Coding theory
joint source-channel coding
0.412020
Forward-Aware Information Bottleneck-Based Vector Quantization for Noisy Channels · IEEE Trans. Commun. 2020
Coding theory › source coding › quantization
vector quantization
0.412020
Forward-Aware Information Bottleneck-Based Vector Quantization for Noisy Channels · IEEE Trans. Commun. 2020
Information theory › communication channels › channel models
noisy channel
0.112020
Forward-Aware Information Bottleneck-Based Vector Quantization for Noisy Channels · IEEE Trans. Commun. 2020

Methods — techniques the papers use, named apart from their topics

variational principle · 0.4non-convex optimization · 0.4information bottleneck · 0.4
YearPublicationVenuePosition
2020 Forward-Aware Information Bottleneck-Based Vector Quantization for Noisy Channels
abstract
The main focus will be on the indirect Joint Source-Channel Coding problem in which a noisy observation of the source has to be quantized ahead of transmission over an error-prone forward link to a remote processing unit. To that end, we present here a complete extension to the preliminary Information Bottleneck method by providing the formal optimal solution to this newly established Variational Principle, together with an algorithm, the Forward-Aware Vector Information Bottleneck (FAVIB), to pragmatically tackle its underlying non-convex design optimization. FAVIB extends the current state-of-the-art approaches via capacitating a full sweep over the entire gamut of the trade-off parameter. Consequently, the trajectory of all achievable points in the Information-Compression plane becomes traversable via soft mappings. It will be shown that, by enjoying an inherent error protection, this novel compression scheme can obviate the call for separate channel coding on the forward path.
Shayan Hassanpour, Tobias Monsees, Dirk Wübben, Armin Dekorsy
IEEE Trans. Commun.2