Secrecy Optimization for Diffusion-Based Molecular Timing Channels
نویسندگان
چکیده
منابع مشابه
Optimal Detection for Diffusion-Based Molecular Timing Channels
This work studies optimal detection for communication over diffusion-based molecular timing (DBMT) channels. The transmitter simultaneously releases multiple information particles, where the information is encoded in the time of release. The receiver decodes the transmitted information based on the random time of arrival of the information particles, which is modeled as an additive noise channe...
متن کاملCapacity Limits of Diffusion-Based Molecular Timing Channels
This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random time of arrival can be represented as an additive noise channel, and for the diffusion-based MT (DBMT) channel this noise is distributed according to the Lév...
متن کاملStrong Secrecy for Wireless Channels
Recent theoretical a potential to signifi information-theoreti concerns, which we community that a s bits from a block o protected data. Even information bits can information-theoreti weak notion of secre ultimate secrecy ra namely one which b bridge the existing security, we present criterion. As in the formulation. The ex
متن کاملTime-slotted transmission over molecular timing channels
This work studies time-slotted communication over molecular timing (MT) channels. The transmitter, assumed to be perfectly synchronized in time with the receiver, is required to send K bits to the receiver using K information particles. It releases a single information particle in each time-slot, where the information is encoded in the time of release. The receiver decodes the transmitted infor...
متن کاملStrong Secrecy for Multiple Access Channels
We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Molecular, Biological and Multi-Scale Communications
سال: 2021
ISSN: 2372-2061,2332-7804
DOI: 10.1109/tmbmc.2021.3054907