Abstract
Counting, or more formally the mathematics of combinatorics, comprises some of the most difficult and intriguing problems in all of mathematics. It is the essential tool of discrete probability theory as well as serving in other fields of interest to data engineers such as fault isolation, cryptography, and network reliability and survivability.
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
Preview
Unable to display preview. Download preview PDF.
References
Brockwell, P. (1964), An Asymptotic Expansion for the Tail of a Binomial Distribution and Its Application in Queueing Theory, Journal of Applied Probability, Vol. 1, pp. 163–169.
Deo, N. (1968), Generalized Parallel Redundancy in Digital Computers, IEEE Transactions on Computers, Vol. 17, p. 600.
Feller, W. (1950), An Introduction to Probability Theory and Its Applications, Vol. I, 2nd ed., Wiley, New York.
Gardner, M. (1968), Mathematical Games, Scientific American, Vol. 218, p. 112+, June.
Gardner, M. (1970), Mathematical Games, Scientific American, Vol. 223, p. 110+, December.
Gardner, M. (1976), Mathematical Games, Scientific American, Vol. 234, p. 119+, March.
Greenwood, R. (1953), The Number of Cycles Associated with the Elements of a Permutation Group, American Mathematical Monthly, Vol. 60, pp. 407–409.
Kruskal, M. (1954), The Expected Number of Components Under a Random Mapping Function, American Mathematical Monthly, Vol. 61, pp. 392–397.
Lehmer, D. (1964), The Machine Tools of Combinatorics, in Applied Combinatorial Mathematics, Wiley, New York, pp. 5–31.
Liu, C. (1968), Introduction to Combinatorial Mathematics, McGraw-Hill, New York.
Niven, I. (1965), Mathematics of Choice, Random House, New York.
Parzen, E. (1960), Modern Probability Theory and Its Applications, Wiley, New York.
Robins, A. (1925), A Remark on Stirling’s Formula, American Mathematical Monthly, Vol. 32, pp. 26–29.
Tucker, A. (1980), Applied Combinatorics, Wiley, New York.
Wyler, O. (1964), Problem Solutions, American Mathematical Monthly, pp. 220–222.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Plenum Press, New York
About this chapter
Cite this chapter
Hershey, J.E., Rao Yarlagadda, R.K. (1986). Counting and Probability. In: Data Transportation and Protection. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2195-8_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2195-8_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9290-6
Online ISBN: 978-1-4613-2195-8
eBook Packages: Springer Book Archive