Search arXivSearch

arXiv · 2602.00140

Information Propagation and Encoding in Solids: A Quantitative Approach Towards Mechanical Intelligence

Abstract

Engineered systems typically separate mechanical function from information processing, whereas biological systems can exploit physical structure as a medium for information processing and computation. Motivated by this contrast, recent work in mechanics has explored embedding information-processing capabilities directly into mechanical structures. However, quantitative frameworks for evaluating such capabilities remain limited. Here we address a foundational question: how does information propagate through a solid body? Using elastic bodies as a model system, we apply information-theoretic tools to treat an elastic domain as an information encoder and quantify how information transmits from applied loads to discrete sensor locations. We further connect these measures to familiar mechanical phenomena, including Saint-Venant's effect and principal stress lines. Moving toward design, we show how geometry and architected materials can tune transmission, enabling elastic domains to either transmit or block information. Overall, this work advances quantifiable metrics and benchmark tasks for mechanical intelligence, supporting comparable designs of mechanically embodied information processing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peerasait Prachaseree, Emma Lejeune. 2026-07-31. Information Propagation and Encoding in Solids: A Quantitative Approach Towards Mechanical Intelligence. https://arxiv.org/abs/2602.00140

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT