Skip to main content
SpringerLink
Log in

On exponential bounds for binomial probabilities

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. V. Uspensky,Introduction to Mathematical Probability, New York, 1937.

  2. P. Levy,Theorie de l’addition des variables aleatoires, Gauthier Villars, Paris, 1954.

    MATH  Google Scholar 

  3. M. Okamoto, “Some inequalities relating to the partial sum of binomial probabilities,”Ann. Inst. Statist. Math., 10 (1958), 29–35.

    Article  MATH  MathSciNet  Google Scholar 

  4. H. Chernoff, “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations,”Ann. Math. Statist., 23 (1952), 493–507.

    Article  MATH  MathSciNet  Google Scholar 

  5. K. Matusita, “Decision rules based on the distance for problems for fit, two samples and estimation,”Ann. Math. Statist., 26 (1955), 631–640.

    Article  MATH  MathSciNet  Google Scholar 

  6. K. Matusita and H. Akaike, “Decision rules, based on the distance, for the problems of independence, invariance and two samples,”Ann. Inst. Statist. Math., 7 (1956), 67–80.

    MATH  MathSciNet  Google Scholar 

  7. K. Matusita and M. Motoo, “On the fundamental theorem for the decision rule based on distance ‖ ‖,”Ann. Inst. Statist. Math., 7 (1956), 137–142.

    Article  MATH  MathSciNet  Google Scholar 

  8. W. Hoeffding, “Probability inequalities for sums of bounded random variables,”J.Amer. Statist. Ass., No. 301, 58 (1963), 13–30.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. M. Wozencraft and B. Reiffen,Sequential Decoding, The Technology Press of the Massachusetts Institute of Technology and John Wiley & Sons, Inc., New York, London, 1961.

    MATH  Google Scholar 

  10. J. Wolfowitz,Coding Theorems of Information Theory, Second edition, Springer-Verlag, Berlin-Göttingen-Heidelberg, New York, 1964.

    MATH  Google Scholar 

  11. S. Kotz, “Some inequalities for convex functions useful in information theory,”SIAM Review, 7 (1965), No. 3, 395–402.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, University of Toronto, USA

    N. Singh Kambo & Samuel Kotz

Authors
  1. N. Singh Kambo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samuel Kotz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by the National Research Council of Canada (Grant A-2873)

About this article

Cite this article

Kambo, N.S., Kotz, S. On exponential bounds for binomial probabilities. Ann Inst Stat Math 18, 277–287 (1966). https://doi.org/10.1007/BF02869535

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02869535

Keywords

Search

Navigation