Maximizing Entropy over Markov Processes

DOI10.1007/978-3-642-37064-9_13zbMath1377.68127OpenAlexW1982254239MaRDI QIDQ4910452

Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wąsowski

Publication date: 18 March 2013

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01242612/file/main.pdf

Mathematics Subject Classification ID

Cryptography (94A60) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Measures of information, entropy (94A17) Network protocols (68M12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Unnamed Item ⋮ Quantifying information leakage of randomized protocols

This page was built for publication: Maximizing Entropy over Markov Processes