Abstract
Let \((\Omega ,{\mathcal A},\Pr )\) be a fixed probability space. Let S = {s 1, s 2, s 3, …, s n} be a finite set, and let X : Ω → S be a random variable with distribution function f X : S → [0, 1], \(f_X(s_i) = \Pr (X=s_i)\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A.G. Konheim, Cryptography: A Primer (Wiley, New York, 1981)
C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379–423 (1948)
C.E. Shannon, A mathematical theory of communication. Bell Syst. Tech. J. 27, 623–656 (1948)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Underwood, R.G. (2022). Information Theory and Entropy. In: Cryptography for Secure Encryption. Universitext. Springer, Cham. https://doi.org/10.1007/978-3-030-97902-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-97902-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97901-0
Online ISBN: 978-3-030-97902-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)