Search arXivSearch

arXiv · 2506.22137

On Drug Delivery System Parameter Optimisation via Semantic Information Theory

Abstract

We investigate the application of semantic information theory to drug delivery systems (DDS) within the molecular communication (MC) framework. To operationalise this, we observe a DDS as a molecular concentration-based channel. Semantic information is defined as the amount of information required for a DDS to achieve its therapeutic goal in a dynamic environment. We derive it by introducing interventions, defined as modifications to DDS parameters, a viability function, and system-environment correlations quantified via the channel capacity. Here, the viability function represents DDS performance based on a drug dose-response relationship. Our model considers a system capable of inducing functional changes in a receiver cancer cell, where exceeding critical DDS parameter values can significantly reduce performance or cost-effectiveness. By analysing the MC-based DDS model through a semantic information perspective, we examine how correlations between the internalised particle concentration $(Y)$ and the particle concentration in the extracellular environment $(X)$ evolve under interventions. The final catalogue of results provides a quantitative basis for DDS design and optimisation, offering a method to determine optimal DDS parameter values under constraints such as chemical budget, desired effect and accuracy. Thus, the proposed framework can serve as a novel tool for guiding DDS design and optimisation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milica Lekić, Mohammad Zoofaghari, Ilangko Balasingham, Mladen Veletić. 2025-06-27. On Drug Delivery System Parameter Optimisation via Semantic Information Theory. https://doi.org/10.1109/tmbmc.2025.3610350

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