Entropy, universal coding, approximation, and bases properties

DOI10.1007/S00365-003-0556-ZzbMATH Open1055.41015OpenAlexW1980161306MaRDI QIDQ1879237FDOQ1879237

Authors: Gérard Kerkyacharian, Dominique Picard 

Publication date: 22 September 2004

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-003-0556-z

Recommendations

• Replicant compression coding in Besov spaces
• An adaptive compression algorithm in Besov spaces
• scientific article; zbMATH DE number 2065342
• Some remarks on nonlinear approximation with Schauder bases
• On entropy numbers and nonlinear approximation by sets of finite pseudo-dimension

zbMATH Keywords

entropy\(m\)-term approximationgreedy basescoding

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Cited In (21)

• Democracy functions and optimal embeddings for approximation spaces
• Restricted non-linear approximation in sequence spaces and applications to wavelet bases and interpolation
• Encoding Tasks and Rényi Entropy
• Spaces of Besov-Sobolev type and a problem on nonlinear approximation
• Convergence rates of posterior distributions for Brownian semimartingale models
• Restricted thresholding: recovering smoothness and preserving edges
• Orthonormal bases for \(\alpha\)-modulation spaces
• Results on non-linear approximation for wavelet bases in weighted function spaces
• Entropy and Source Coding for Integer-Dimensional Singular Random Variables
• Properties of discrete uncertainty spaces. Refinement of the basic coding theorem
• Entropy preservation under Markov coding.
• Entropy encoding, Hilbert space, and Karhunen-Loève transforms
• Wavelets, Orlicz spaces, and greedy bases
• Best \(m\)-term approximation and Lizorkin-Triebel spaces
• On the representation of smooth functions on the sphere using finitely many bits
• Democracy of shearlet frames with applications
• Simultaneous approximation by greedy algorithms
• Title not available (Why is that?)
• Greedy approximation with regard to non-greedy bases
• Replicant compression coding in Besov spaces
• Title not available (Why is that?)

This page was built for publication: Entropy, universal coding, approximation, and bases properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879237)