Algebraic Information Theory For Binary Channels

Electronic Notes in Theoretical Computer Science

Volumn 158, Issue 1, 2006, Pages 289-306

  Martin, Keye ^a   Moskowitz, Ira S ^a   Allwein, Gerard ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

covert channel; domain theory; information theory; monoid

Indexed keywords

ALGEBRA; BINARY SEQUENCES; COMPUTER SCIENCE; PROBLEM SOLVING;

BINARY CHANNELS; COVERT CHANNEL; DOMAIN THEORY; MONOID;

INFORMATION THEORY;

EID: 33646483492     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.04.015     Document Type: Article

References (5)

1. Abramsky S., and Jung A. Domain theory. In: Abramsky S., Gabbay D.M., and Maibaum T.S.E. (Eds). Handbook of Logic in Computer Science, vol. III (1994), Oxford University Press
2. Edalat A., and Escardo M. Integration in real PCF. Information and Computation 160 1-2 (2000) 128-166
3. Martin K. Entropy as a fixed point. ICALP 2004. Theoretical Computer Science 350 2-3 (2003) 292-324
4. K. Martin and I.S. Moskowitz. Noisy timing channels with binary inputs and outputs. Information Hiding, Lecture Notes in Computer Science, Springer-Verlag, 2006, to appear
5. Shannon C.E. A mathematical theory of communication. Bell Systems Technical Journal 27 (1948) 379-423 623-656