Fourier transform bounded Kolmogorov complexity

DOI10.1016/J.PHYSD.2023.133824MaRDI QIDQ6111920zbMATH OpenOpenAlexFDO

Authors Mohammed Terry-Jack, Simon O'Keefe

Publication date 4 August 2023

Published in Physica D (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.physd.2023.133824

zbMATH Keywords

algorithmic information theorybinarisationdiscrete Fourier transformKolmogorov complexitylossless compressionquantisation

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• scientific article; zbMATH DE number 67357 (Why is no real title available?)
• scientific article; zbMATH DE number 1142293 (Why is no real title available?)
• Integer fast Fourier transform
• Kolmogorov complexity and cellular automata classification
• Measures of statistical complexity: why?
• Similarity and denoising

This page was built for publication: Fourier transform bounded Kolmogorov complexity

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