An Optimal, Universal and Agnostic Decoding Method for Message Reconstruction, Bio and Technosignature Detection
Not on the map. Why?
Abstract (arXiv)
We present an agnostic signal reconstruction method for zero-knowledge one-way communication channels in which a receiver aims to interpret a message sent by an unknown source about which no prior knowledge is available and to which no return message can be sent. Our reconstruction method is agnostic vis-`a-vis the arbitrarily chosen encoding-decoding scheme and other observer-dependent characteristics, such as the arbitrarily chosen computational model, probability distributions, or underlying mathematical theory. We investigate how non-random messages encode information about their intended physical properties, such as dimension and length scales of the space in which a signal or message may have been originally encoded, embedded, or generated. We focus on image data as a first illustration of the capabilities of the new method. We argue that our results have applications to life and technosignature detection, and to coding theory in general.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 63 references that are in the map. First posted on arXiv 28 Mar 2023.
Builds on
6 of 63 references.
References · 6
- 2021Emergence and algorithmic information dynamics of systems and observerscited by 3
- 2018Minimal Algorithmic Information Loss Methods for Dimension Reduction, Feature Selection and Network Sparsificationcited by 2
- 2018Algorithmic Complexity and Reprogrammability of Chemical Structure Networkscited by 2
- 2020An Algorithmic Information Distortion in Multidimensional Networkscited by 2
- 2022The Case for Technosignatures: Why They May Be Abundant, Long-lived, Highly Detectable, and Unambiguouscited by 2
- 2021Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexitycited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.