Journal article
Effective normalization of complexity measurements for epoch length and sampling frequency
Physical review. E, Statistical, nonlinear, and soft matter physics, v 64(1), pp 016209/9-9
01 Jul 2001
PMID: 11461369
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.
Metrics
Details
- Title
- Effective normalization of complexity measurements for epoch length and sampling frequency
- Creators
- P E Rapp - Drexel UniversityC J CellucciK E Korslund - University of WashingtonTAA WatanabeM A Jimenez-Montano - Universidad de las Américas Puebla
- Publication Details
- Physical review. E, Statistical, nonlinear, and soft matter physics, v 64(1), pp 016209/9-9
- Publisher
- Amer Physical Soc
- Number of pages
- 9
- Resource Type
- Journal article
- Language
- English
- Web of Science ID
- WOS:000169907300055
- Scopus ID
- 2-s2.0-84983708303
- Other Identifier
- 991019330630504721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Physics, Fluids & Plasmas
- Physics, Mathematical