paper

The coding complexity of Lévy processes

arXiv:0707.3040 · doi:10.1007/s10208-008-9035-z

Abstract

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.

26 pages

Cited by in corpus (1)

The coding complexity of Lévy processes · wovepaper