Redundancy of information: lowering effective dimension

DOI10.1016/J.JCSS.2025.103732MaRDI QIDQ6859748zbMATH OpenFDO

Authors Jun Le Goh, Joseph S. Miller, Mariya I. Soskova, Linda Brown Westrick

Publication date 11 February 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103732

zbMATH Keywords

algorithmic randomnessBesicovitch pseudometriccovering codeseffective dimensionHamming distanceKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites work

• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Algorithmic randomness and complexity.
• Borel cardinalities below c₀
• Dimension 1 sequences are close to randoms
• Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
• Effective aspects of Bernoulli randomness
• scientific article; zbMATH DE number 1670880 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1290306 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• Intermediate intrinsic density and randomness
• Quasi-uniform convergence in compact dynamical systems
• Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
• The definition of random sequences
• The dimensions of individual strings and sequences
• The probability distribution as a computational resource for randomness testing

This page was built for publication: Redundancy of information: lowering effective dimension

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