Related Experiment Video
Updated: Jul 23, 2026

Applications of EEG Neuroimaging Data: Event-related Potentials, Spectral Power, and Multiscale Entropy
Published on: June 27, 2013
Effective normalization of complexity measurements for epoch length and sampling frequency
P E Rapp1, C J Cellucci, K E Korslund
1Department of Pharmacology and Physiology, Medical College of Pennsylvania Hahnemann University, Philadelphia, Pennsylvania 19129, USA. Paul.E.Rapp@Drexel.edu
Abstract:
The algorithmic complexity of a symbol sequence is sensitive to the length of the message. Additionally, in those cases where the sequence is constructed by the symbolic reduction of an experimentally observed wave form, the corresponding value of algorithmic complexity is also sensitive to the sampling frequency. In this contribution, we present definitions of algorithmic redundancy that are sequence-sensitive generalizations of Shannon's original definition of information redundancy. In contrast with algorithmic complexity, we demonstrate that algorithmic redundancy is not sensitive to message length or to observation scale (sampling frequency) when stationary systems are examined.
Related Concept Videos
Measurement: Standard Units
Properties of Fourier series II
A function f(t) is...
Sampling Theorem
Aliasing
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Upsampling

