Abstract
In Chap. 2 we defined thenovelty of a proposition as a special function of its probability p(A). We motivated the definition \(\mathcal{N}(A) = {-\log }_{2}p(A)\) by the idea that \(\mathcal{N}(A)\) should measure the number of yes–no questions needed to guess A.
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
Notes
- 1.
Modified from Beutelspacher, A. (1993). Kryptologie. Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden.
References
Bose, R. C., & Ray-Chaudhuri, D. K. (1960). On a class of error correcting binary group codes. Information and Control, 3, 68–79.
Fano, R. M. (1961). Transmission of information: A statistical theory of communications. New York: Wiley.
Hamming, R. V. (1950). Error detecting and error correcting codes. Bell Systems Technical Journal, 29, 147–160.
Huffman, D. A. (1952). A method for the construction of minimum redundancy codes. Proceedings of the IRE, 40, 1098–1101.
Shannon, C. E. (1948). A mathematical theory of communication. Bell Systems Technical Journal, 27, 379–423, 623–656.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Palm, G. (2012). On Guessing and Coding. In: Novelty, Information and Surprise. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29075-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-29075-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29074-9
Online ISBN: 978-3-642-29075-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)