An Optimal, Universal and Agnostic Decoding Method for Message Reconstruction, Bio and Technosignature Detection

• URL: http://arxiv.org/abs/2303.16045v4
• Date: Fri, 10 Jan 2025 02:39:43 GMT
• Title: An Optimal, Universal and Agnostic Decoding Method for Message Reconstruction, Bio and Technosignature Detection
• Authors: Hector Zenil, Alyssa Adams, Felipe S. Abrahão, Luan Ozelim,
• Abstract summary: We present an agnostic signal reconstruction method for zero-knowledge one-way communication channels.<n>We investigate how non-random messages encode information about their intended physical properties.
• Score: 0.14061979259370275
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• A Communication Framework for Compositional Generation [0.7578439720012189]
  We present a self-supervised generative communication game-based framework for creating compositional encodings. Our framework is based on rigorous justifications and proofs of defining and balancing the concepts of Efficiency, Unambiguity and Non-Holisticity in encoding.
  arXiv  Detail & Related papers  (2025-01-31T14:46:11Z)
• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Decoding Geometric Properties in Non-Random Data from First Information-Theoretic Principles [0.17265013728931003]
  We introduce a univariate signal deconvolution method with a wide range of applications to coding theory. Our multidimensional space reconstruction method from an arbitrary received signal is proven to be vis-a-vis the encoding-decoding scheme. We argue that this optimal and universal method of decoding non-random data has applications to signal processing, causal deconvolution, topological and geometric properties encoding, cryptography, and bio-signature and techno signature detection.
  arXiv  Detail & Related papers  (2024-05-13T14:45:08Z)
• Joint Sensing and Task-Oriented Communications with Image and Wireless Data Modalities for Dynamic Spectrum Access [49.83882366499547]
  This paper introduces a deep learning approach to dynamic spectrum access, leveraging the synergy of multi-modal image and spectrum data for the identification of potential transmitters. We consider an edge device equipped with a camera that is taking images of potential objects such as vehicles that may harbor transmitters. We propose a collaborative system wherein the edge device communicates selectively processed information to a trusted receiver acting as a fusion center.
  arXiv  Detail & Related papers  (2023-12-21T15:26:26Z)
• Rate-Distortion-Perception Theory for Semantic Communication [73.04341519955223]
  We study the achievable data rate of semantic communication under the symbol distortion and semantic perception constraints. We observe that there exists cases that the receiver can directly infer the semantic information source satisfying certain distortion and perception constraints.
  arXiv  Detail & Related papers  (2023-12-09T02:04:32Z)
• Reverse-Engineering Decoding Strategies Given Blackbox Access to a Language Generation System [73.52878118434147]
  We present methods to reverse-engineer the decoding method used to generate text. Our ability to discover which decoding strategy was used has implications for detecting generated text.
  arXiv  Detail & Related papers  (2023-09-09T18:19:47Z)
• Attention to Entropic Communication [0.0]
  Relative entropy (RE), aka Kullback-Leibler divergence, plays a central role in communication theory. We combine these concepts, attention and RE. RE guides optimal encoding of messages in bandwidth-limited communication.
  arXiv  Detail & Related papers  (2023-07-21T08:33:55Z)
• Semantic Communication of Learnable Concepts [16.373044313375782]
  We consider the problem of communicating a sequence of concepts, i.e., unknown and potentially maps, which can be observed only through examples. The transmitter applies a learning algorithm to the available examples, and extracts knowledge from the data. The transmitter then needs to communicate the learned models to a remote receiver through a rate-limited channel.
  arXiv  Detail & Related papers  (2023-05-14T11:16:17Z)
• Cognitive Semantic Communication Systems Driven by Knowledge Graph: Principle, Implementation, and Performance Evaluation [74.38561925376996]
  Two cognitive semantic communication frameworks are proposed for the single-user and multiple-user communication scenarios. An effective semantic correction algorithm is proposed by mining the inference rule from the knowledge graph. For the multi-user cognitive semantic communication system, a message recovery algorithm is proposed to distinguish messages of different users.
  arXiv  Detail & Related papers  (2023-03-15T12:01:43Z)
• Adversarial Learning for Implicit Semantic-Aware Communications [104.08383219177557]
  We develop a novel adversarial learning-based implicit semantic-aware communication architecture (iSAC) We prove that by applying iSAC, the destination user can always learn an inference rule that matches the true inference rule of the source messages. Experimental results show that the proposed iSAC can offer up to a 19.69 dB improvement over existing non-inferential communication solutions.
  arXiv  Detail & Related papers  (2023-01-27T08:28:12Z)
• Neuro-Symbolic Causal Reasoning Meets Signaling Game for Emergent Semantic Communications [71.63189900803623]
  A novel emergent SC system framework is proposed and is composed of a signaling game for emergent language design and a neuro-symbolic (NeSy) artificial intelligence (AI) approach for causal reasoning. The ESC system is designed to enhance the novel metrics of semantic information, reliability, distortion and similarity.
  arXiv  Detail & Related papers  (2022-10-21T15:33:37Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Autoregressive Belief Propagation for Decoding Block Codes [113.38181979662288]
  We revisit recent methods that employ graph neural networks for decoding error correcting codes. Our method violates the symmetry conditions that enable the other methods to train exclusively with the zero-word. Despite not having the luxury of training on a single word, and the inability to train on more than a small fraction of the relevant sample space, we demonstrate effective training.
  arXiv  Detail & Related papers  (2021-01-23T17:14:55Z)
• Capacity-Approaching Autoencoders for Communications [4.86067125387358]
  The current approach to train an autoencoder relies on the use of the cross-entropy loss function. We propose a methodology that computes an estimate of the channel capacity and constructs an optimal coded signal approaching it.
  arXiv  Detail & Related papers  (2020-09-11T08:19:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.