On the computation of covert channel capacity
From MaRDI portal
Publication:5190077
DOI10.1051/ita/2010004zbMath1185.94035OpenAlexW1969827827MaRDI QIDQ5190077
Publication date: 12 March 2010
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44611
Cellular automata (computational aspects) (68Q80) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic synchronization of automata with bounded delay
- Determinization of transducers over finite and infinite words.
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Joint Spectral Characteristics of Matrices: A Conic Programming Approach
- Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
- An Introduction to Symbolic Dynamics and Coding