On the distribution of runs of ones in binary strings

Computers and Mathematics with Applications

Volumn 58, Issue 9, 2009, Pages 1816-1829

  Sinha, Koushik ^a   Sinha, Bhabani P ^b  

^a HONEYWELL TECHNOLOGY SOLUTIONS   (India)

^b INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Bernoulli's trial; Counting problem; Generating function,; Run distribution; Run statistics

Indexed keywords

BERNOULLI'S TRIAL; COUNTING PROBLEM; GENERATING FUNCTION,; RUN DISTRIBUTION; RUN STATISTICS;

COMPUTER NETWORKS; ENERGY EFFICIENCY; FUNCTION EVALUATION; KNOWLEDGE ENGINEERING; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

DATA COMPRESSION;

EID: 70349108322     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2009.07.057     Document Type: Article

References (35)

1. Zehavi J.E., and Wolf J.K. On runlength codes. IEEE Trans. Inform. Theory 34 (1988) 45-54
2. S.T. Klein, T.C. Serebro, D. Shapira, Modeling delta encoding of compressed files, in: Data Compression Conference, 2006
3. J.C. Mogul, F. Douglis, A. Feldmann, B. Krishnamurthy, Potential benefits of delta encoding and data compression for HTTP, in: Proc. ACM SIGCOMM Conf. on Applications, Technologies, Architectures and Protocols for Computer Communication, 1997, pp. 181-194
4. C.H. Messom, G.S. Gupta, S. Demidenko, Hough transform run length encoding for real-time image processing, in: Proc. of Instrumentation and Measurement Technology Conference, IMTC, vol. 3, issue 16-19, May 2005, pp. 2198-2202
5. Nagasaka A., and Miyatake T. Real-time scene identification using run-length encoding of video feature sequences. J. Robot. Mechatron. 11 2 (1999) 98-103
6. Tagaki N., Yassura H., and Yajima S. High speed VLSI multiplication algorithm with a redundant binary addition tree. IEEE Trans. Comput. C-34 (1985) 789-796
7. De M., and Sinha B.P. Fast parallel multiplication using redundant quarternary number system. Parallel Process. Lett. 7 1 (1997) 13-23
8. K. Sinha, Location and communication issues in mobile networks, Ph.D. Dissertation, Dept. of Computer Science and Engineering, Jadavpur University, Calcutta, India, 2007
9. K. Sinha, An energy efficient communication scheme for applications based on low power wireless networks, in: Proc. 6th IEEE Consumer Communications and Networking Conference, CCNC, Las Vegas, USA, Jan. 2009, pp. 1-5
10. Sinha K., and Sinha B.P. An energy efficient communication scheme for distributed computing applications in wireless sensor networks. Proc. Intl. Conf. on Distributed Computing and Internet Technologies. ICDCIT. LNCS (2008) 139-144
11. Vittal A., and Sadowska M.M.-. Crosstalk reduction for VLSI. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 16 3 (1997) 290-298
12. Shin Y., Choi K., and Chang Y.-H. Narrow bus encoding for low-power DSP systems. IEEE Trans. Very Large Scale Integr. Syst. 9 5 (2001) 656-660
13. Stan M.R., and Burleson W.P. Bus-invert coding for low power I/O. IEEE Trans. Very Large Scale Integr. Syst. 3 (1995) 49-58
14. Ramprasad S., Shanbhag N.R., and Hajj I.N. A coding framework for low-power address and data buses. IEEE Trans. Very Large Scale Integr. Syst. 7 (1999) 212-221
15. L. Benini, G.D. Micheli, E. Macii, D. Sciuto, C. Silvano, Asymptotic zero-transition activity encoding for address busses in low-power microprocessor-based systems, in: Proc. Great Lakes Symp. VLSI, Mar. 1997, pp. 77-82
16. C.L. Su, C.Y. Tsui, A.M. Despain, Low power architecture design and compilation technique for high-performance processors, in: Proc. IEEE COMPCON, Feb. 1994, pp. 209-214
17. Y. Zhang, J. Lach, K. Skandron, M.R. Stan, Odd/even bus invert with two-phase transfer for buses with coupling, in: Proc. ISLPED, USA, Aug. 2002, pp. 12-14
18. Khan Z., Arslan T., and Erdogan A.T. Low power system on chip bus encoding scheme with crosstalk noise reduction capability. IEE Proc., Comput. Digit. Tech. 153 2 (2006) 101-108
19. Hsieh W.-W., Chen P.-Y., Wang C.-Y., and Hwang T.-T. A bus-encoding scheme for crosstalk elimination in hgih-performance processor design. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 26 12 (2007) 2222-2227
20. Cochran W.G. An extension of Gold's method for examining the apparent persistence of one type of weather. Q.J.R. Meteorol. Soc. 64 (1938) 631-634
21. Mood A.M. The distribution theory of runs. Ann. Math. Stat. 11 (1940) 367-392
22. Wishart J., and Hirshfeld H.O. On a test whether two samples are from the same population. J. Lond. Math. Soc. 11 (1936) 227-235
23. Wolfowitz J. On the theory of runs with some applications to quality control. Ann. Math. Stat. 14 (1943) 280-288
24. Fu J.C., and Koutras M.V. Distribution theory of runs: A Markov chain approach. J. Amer. Statist. Assoc. 89 427 (1994) 1050-1058
25. Makri F.S., Philippou A.N., and Psillakis Z.M. Shortest and longest length of success runs in binary sequences. J. Statist. Plann. Inference 137 (2007) 2226-2239
26. Muselli M. Simple expressions for success runs distributions in Bernoulli trials. Statist. Probab. Lett. 31 (1996) 121-128
27. Stefanov V.T. On run statistics for binary trials. J. Statist. Plann. Inference 87 (2000) 177-185
28. Balakrishnan N., and Koutras M.V. Runs and Scan with Applications (2002), John Wiley, New York
29. Feller W. An Introduction to Probability Theory and its Applications, vol. 1. 3rd ed. (1968), John Wiley, New York
30. Ling K.D. On binomial distributions of order k. Statist. Probab. Lett. 6 (1988) 247-250
31. Gibbons J.D. Nonparametric Statistical Inference (1971), McGraw-Hill, New York
32. E. Musoll, T. Lang, J. Cortadella, Exploiting the locality of memory references to reduce the address bus energy, in: Proc. Intl. Symp. Low Power Electronics Design, 1997, pp. 202-207
33. Cohen D.I.A. Basic Techniques of Combinatorial Theory (1979), John Wiley & Sons Inc., New York
34. Liu C.L. Introduction to Combinatorial Mathematics (1968), McGraw-Hill, New York
35. Wilf H.S. Generating Functionolgy. 2nd ed. (1994), Academic Press Inc.