Algebraic information theory for binary channels

Authors:
Keye Martin;Ira S. Moskowitz;Gerard Allwein
Affiliations:
Center for High Assurance Computer Systems, Code 5540, US Naval Research Laboratory, Washington, DC 20375, United States;Center for High Assurance Computer Systems, Code 5540, US Naval Research Laboratory, Washington, DC 20375, United States;Center for High Assurance Computer Systems, Code 5540, US Naval Research Laboratory, Washington, DC 20375, United States
Venue:
Theoretical Computer Science
Year:
2010

Citing 5
Cited 0

Integration in real PCF

Information and Computation - Special issue: LICS 1996—Part 1
A foundation for computation

A foundation for computation
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
Noisy timing channels with binary inputs and outputs

IH'06 Proceedings of the 8th international conference on Information hiding

Quantified Score

Hi-index	5.23

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 Martin (2006) [4]. 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.