N. Erodol

dblp:134/5296 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1979
—ORCID · none

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

Theory of computation · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding
rate-distortion theory
0.011979
Bounds on R1 (D) functions for speech probability models (Corresp.) · IEEE Trans. Inf. Theory 1979
Coding theory › source coding
source modeling
0.011979
Bounds on R1 (D) functions for speech probability models (Corresp.) · IEEE Trans. Inf. Theory 1979

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

laplacian density · 0.0gamma density · 0.0bessel function bounds · 0.0
YearPublicationVenuePosition
1979 Bounds on R1 (D) functions for speech probability models (Corresp.)
abstract
Upper and lower bounds on first-order rate-distortion functions are derived for some selected speech probability models and two different fidelity criteria. The bounds are computed numerically when the analytical procedures are intractable. The models employed involve the Laplacian density, the gamma density, and first- and second-order modified Bessel functionsK_{o}andK_{1}. For both the absolute difference and the mean-square difference distortion measures, theK_{o}model yields the tightest bounds onR_{1}(D)functions.
Hüseyin Abut, N. Erodol
IEEE Trans. Inf. Theory2