Algebraic Information Theory For Binary Channels

Authors:
Keye Martin;Ira S. Moskowitz;Gerard Allwein
Affiliations:
Center for High Assurance Computer Systems, Code 5540, U.S. Naval Research Laboratory, Washington D.C. 20375;Center for High Assurance Computer Systems, Code 5540, U.S. Naval Research Laboratory, Washington D.C. 20375;Center for High Assurance Computer Systems, Code 5540, U.S. Naval Research Laboratory, Washington D.C. 20375
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 3
Cited 6

Domain theory

Handbook of logic in computer science (vol. 3)
Integration in real PCF

Information and Computation - Special issue: LICS 1996—Part 1
Entropy as a fixed point

Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)

Topology in information theory in topology

Theoretical Computer Science
A Domain Theoretic Model of Qubit Channels

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Technique for Verifying Measurements

Electronic Notes in Theoretical Computer Science (ENTCS)
A Monotonicity Principle for Information Theory

Electronic Notes in Theoretical Computer Science (ENTCS)
Noisy timing channels with binary inputs and outputs

IH'06 Proceedings of the 8th international conference on Information hiding
How to Randomly Flip a Quantum Bit

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the algebraic structure of the monoid of binary channels and show that it is dually isomorphic to the interval domain over the unit interval with the operation from [K. Martin. Entropy as a fixed point. ICALP 2004. Theoretical Computer Science, Volume 350, Issues 2-3, p. 292-324, 2006]. We show that the capacity of a binary channel is Scott continuous as a map on the interval domain and that its restriction to any maximally commutative submonoid of binary channels is an order isomorphism onto the unit interval. These results allows us to solve an important open problem in the analysis of covert channels: a provably correct method for injecting noise into a covert channel which will reduce its capacity to any level desired in such a way that the practitioner is free to insert the noise at any point in the system.