2000 character limit reached
Inscribed Matter Communication: Part II
Published 16 Jun 2016 in cs.ET, cs.IT, and math.IT | (1606.05036v2)
Abstract: This paper is Part II of a two-paper set which develops a finest-grain per-molecule timing treatment of molecular communication. We first consider a simple one-molecule timing channel with a molecule launch deadline, similar to but different from previous work ("Bits Through Queues") where the constraint was mean launch time. We also derive a number of results related to the {\em ordering entropy}, a key quantity which undergirds the capacity bounds for the molecular timing channel, both with and without token data payloads. We then conclude with an upper bound on molecular timing-channel capacity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.