2008
DOI: 10.1007/s10208-008-9035-z
|View full text |Cite
|
Sign up to set email alerts
|

The Coding Complexity of Lévy Processes

Abstract: Summary. We investigate the high resolution coding problem for general real-valued Lévy processes under L p [0, 1]-norm distortion. Tight asymptotic formulas are found under mild regularity assumptions.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…The theorems and examples presented in this subsection complement results from [2], where general real-valued Lévy processes are studied. The main result for compound Poisson processes in that paper states that, for any compound Poisson process with E log max(|Z (1) |, 1) < ∞ and all s ≥ 1,…”
Section: Application To Compound Poisson Processes In R Dmentioning
confidence: 74%
See 3 more Smart Citations
“…The theorems and examples presented in this subsection complement results from [2], where general real-valued Lévy processes are studied. The main result for compound Poisson processes in that paper states that, for any compound Poisson process with E log max(|Z (1) |, 1) < ∞ and all s ≥ 1,…”
Section: Application To Compound Poisson Processes In R Dmentioning
confidence: 74%
“…for fractional Brownian motion, diffusions, or stable-like Lévy processes, see for instance [11,17,12,18,9,10,19,2]). Let us consider a simple example.…”
Section: Lower Boundsmentioning
confidence: 99%
See 2 more Smart Citations