The coding complexity of diffusion processes under \(L^p[0,1]\)-norm distortion (Q927919): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.spa.2007.07.002 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.SPA.2007.07.002 / rank
 
Normal rank

Latest revision as of 08:24, 10 December 2024

scientific article
Language Label Description Also known as
English
The coding complexity of diffusion processes under \(L^p[0,1]\)-norm distortion
scientific article

    Statements

    The coding complexity of diffusion processes under \(L^p[0,1]\)-norm distortion (English)
    0 references
    0 references
    10 June 2008
    0 references
    The paper treates the high resolution quantization and entropy coding problem for \(1\)-dimensional diffusions \(X\) under \(L^p[0,1]\)-norm. The original process \(X\) is an adapted semimartingale solving the integral equaton with non-homogeneous coefficients, and it is approximated by some reconstruction. The quantization error, entropy coding error and the distortion rate function are introduced and analyzed. The main result is the explicit high resolution formula for diffusion that is established in terms of the average diffusion coefficient. At the beginning, the asymptotic coding problem for the Wiener process is considered and then one of the results relates the coding problem for the diffusion to that of a concatenation of Wiener processes. The proofs are based on a decoupling argument in order to analyze the supremum norm distortion setting.
    0 references
    high-resolution quantization
    0 references
    complexity
    0 references
    stochastic processes
    0 references
    stochastic differential equations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references