Complexity distortion theory

DOI10.1109/TIT.2002.808135MaRDI QIDQ4679940zbMATH OpenFDO

Authors Daby M. Sow, Alexandros Eleftheriadis

Publication date 31 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2002.808135

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
• Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
• scientific article; zbMATH DE number 4033655
• Rate distortion function for Nth-order Gaussian Markov process
• scientific article; zbMATH DE number 763790

Cited in

(5)

• Dynamic modeling of internet traffic for intrusion detection
• Computation of the complexity of vector quantizers by affine modeling
• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• On sequential structures in incompressible multidimensional networks
• A generalized approach to linear transform approximations with applications to the discrete cosine transform

This page was built for publication: Complexity distortion theory

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