The coding complexity of L\'evy processes
Abstract
We investigate the high resolution coding problem for general real-valued L\'evy processes under Lp[0,1]-norm distortion. Tight asymptotic formulas are found under mild regularity assumptions.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.