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

J.-C. Batllo

dblp:30/2956 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none

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

Theory of computation · 2 · 1 first-author

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
2 papers
Coding theory · 96% Information theory · 4%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › multiterminal source coding
multiple description coding
0.021998
Asymptotic Analysis of Multiple Description Quantizers · IEEE Trans. Inf. Theory 1998
Asymptotic performance of multiple description transform codes · IEEE Trans. Inf. Theory 1997
Coding theory
source coding
0.021998
Asymptotic Analysis of Multiple Description Quantizers · IEEE Trans. Inf. Theory 1998
Asymptotic performance of multiple description transform codes · IEEE Trans. Inf. Theory 1997
Coding theory › source coding
rate-distortion theory
0.021998
Asymptotic Analysis of Multiple Description Quantizers · IEEE Trans. Inf. Theory 1998
Asymptotic performance of multiple description transform codes · IEEE Trans. Inf. Theory 1997
Coding theory › source coding › quantization › quantization theory
high-rate quantization
0.011998
Asymptotic Analysis of Multiple Description Quantizers · IEEE Trans. Inf. Theory 1998
Coding theory › source coding › quantization
multiple description quantization
0.011998
Asymptotic Analysis of Multiple Description Quantizers · IEEE Trans. Inf. Theory 1998
Information theory
asymptotic analysis
0.011997
Asymptotic performance of multiple description transform codes · IEEE Trans. Inf. Theory 1997

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

companding · 0.0asymptotic analysis · 0.0transform coding · 0.0bit allocation · 0.0
YearPublicationVenuePosition
1998 Asymptotic Analysis of Multiple Description Quantizers
abstract
A high-rate analysis of multiple description quantizers is presented for rth-power distortions and general source densities. Both, fixed-length and variable-length encoding of the quantizer indices are considered. Optimal companding functions are shown to be the same as for single-channel quantizers. As compared to the bound of Ozarow (1980), a gap of 8.69 dB and 3.07 dB exists between the entropy-constrained and level-constrained cases, respectively, for a memoryless Gaussian source and r=2.
Vinay A. Vaishampayan, J.-C. Batllo
IEEE Trans. Inf. Theory2
1997 Asymptotic performance of multiple description transform codes
abstract
The multiple description transform coder is introduced for sources with memory and an asymptotic analysis is presented for the squared error distortion. For stationary Gaussian sources, the optimal transform and the optimal bit allocation for the multiple description coder are identical to those for the single description coder.
J.-C. Batllo, Vinay A. Vaishampayan
IEEE Trans. Inf. Theory1