## Faculty at School of Engineering

### Rakesh Kumar Bansal

Professor

School of Engineering

##### Contact Information

- Email: rakesh.bansal@snu.edu.in

Universal Compression, Sequential Detection of a Change in Distribution, Ergodic Theory and Large Deviation Theory- applications , Robustness

- PhD , MS 1987, 1983 respectively, Electrical Engineering, University of Connecticut
- BTech 1978 , Electrical Engineering , IIT KANPUR

- Retired as
*Professor*of Electrical Engineering after nearly 35 years of association with Indian institute of Technology, Kanpur . Prior to this, one year at University of Virginia with Electrical Engineering and Mathematics departments as Research Associate / Lecturer.

- Recipient of Doctoral Dissertation Fellowship.
- Recipient of Merit cum Means Scholarship during undergraduate study.
- Awarded Notional Prize for meritorious performance in second year of undergraduate programme at IIT Kanpur .
- Completed Undergraduate programme with distinction.

- Past member of
*IEEE Information Theory Society, Institute of Mathematical Statistics, Bernoulli Society*

- Ashwin Verma and R K Bansal,“ Sequential Change Detection Based on Universal Compression For Markov sources,” Proceedings of
**2019**IEEE International Symposium on Information Theory , ( ISIT ) - Jain and R. K. Bansal,“ On Pointwise Redundancy Rate of Bender Wolf ’s Variant of SWLZ Algorithm,” Proceedings of 2016 IEEE Information Theory Workshop, ( ITW ) , University of Cambridge, UK, September 11 to 14 ,
**2016.** - Jain and R. K. Bansal,“ Point-wise Analysis of Redundancy in SWLZ Algorithm for φ-mixing Sources,” Proceedings of
**2015**IEEE Information Theory Workshop ( ITW ) , Jerusalem, Israel, April 26 - May 1, 2015. - Jain and R. K. Bansal,“ Exponential Rates of Convergence for Waiting Times and Generalized AEP,” Proceedings of
**2015**IEEE Information Theory Workshop ( ITW ) , Jerusalem, Israel, April 26- May 1, 2015. - Siddharth Jain and RK Bansal ,“On Match Lengths, Zero Entropy, and Large Deviations with Application to Sliding Window Lempel Ziv Algorithm,” Information Theory, IEEE Transactions on , vol.61, no.1, pp.120 - 132,
**2015**.. - Sharan, V. and RK Bansal, “Large deviation property of waiting times for Markov and mixing processes,” Information Theory (ISIT),
**2014**IEEE International Symposium on Information Theory , vol., no., pp.1096,1100, June 29 2014-July 4**2014**. - Tony Jacob and R.K. Bansal Almost Sure Optimality of Sliding Window Lempel - Ziv Algorithm and Variants Revisited , IEEE Transactions on Information Theory, Vol. IT-59, No. 8, pp. 4977-4984
**, 2013**. - RK Bansal “On Data Compression , Gambling and the Coin Tossing Experiment, Directions”, Vol 11, No.1, pp 133-141, published by Dean, Research and Development, IIT Kanpur, June
**2010.** - R.K. Bansal, and P. Papantoni-Kazakos, Outlier Resistant Algorithms for Detecting a Change in a Stochastic Process, IEEE Transactions on Information Theory, Vol. IT-35, No. 3, pp. 521- 535
**, 1989.** - R.K. Bansal, and P. Papantoni-Kazakos, An Algorithm for Detecting a Change in a Stochastic Process, IEEE Transactions on Information Theory, Vol. IT-32, November 2, pp. 227-235,
**1986.** *This paper also appears almost in its entirety in the book by D. Kazakos and P. Papantoni-Kazakos*

- “On Universal Compression , Shannon’s Entropy and Recurrence Times”, December 16, 2015, Workshop on High performance Digital Signal Processing System Design and Implementation, IIT Bhubaneswar.
- “On Large Deviation Property of Recurrence and Waiting Times”, February 28, 2015, National Conference on Communications, IIT Bombay, Mumbai.
- “Sliding Window Lempel- Ziv AlgorithmPoint-wise Optimality and Extension to Side Information” , December 23, 2009, Electrical Communication Engineering Department, IISc, Bangalore.
- “ On Universal Compression, Shannon’s Entropy and Recurrence Times ”, January 2010, National Conference on Computer Vision, Pattern Recognition, Image processing and Graphics, LNM Institute of Information Technology, Jaipur.
- “ On Universal Compression, Shannon’s Entropy and Recurrence Times”,January 31, 2010, National Institute of Technology , Tiruchirappalli.
- “On Universal Compression , Shannon’s Entropy and Individual Sequences,” February 11, 2006 in TECHNEX, Students’ Technical Festival held at Institute of Technology, BHU, Varanasi.
- “On Data Compression and the Theme of Recurrence,” IETE Sponsored Lecture, IIT Kanpur, March 6, 2005. • “Efficient Representation of Data and Some Compression Algorithms,” Indian Institute of Information Technology and Management Trivandram, Kerala, May 21, 2004.
- “On Coin Tossing, Bits of Information and a Bit of Gambling,” IIT Kanpur, August 22, 2003. • “A Random Walk through Jain Theory of Knowledge and its Implication,” IIT Kanpur, November 9, 2001.
- “On Probability and Measures of Uncertainty - a Historic Viewpoint,” Bharat Heavy Electricals Limited, Jhansi, April 15, 1995.
- “On Robustness in Detection, Estimation and Filtering Problems,” Department of Electrical Engineering, Indian Institute of Science, Bangalore, July 14 1993.
- “On Detection of a Change in a Stochastic Process,” Department of Electrical Engineering, Indian Institute of Science, Bangalore, July 13, 1993.
- “On Weak Continuity and Qualitative Robustness,” Department of Electrical Engineering, Indian Institute of Science, Bangalore, March 10, 1993.
- “Robust Algorithms for Detecting a Change in a Stochastic Process,” Department of Electrical Engineering, Indian Institute of Science, Bangalore, December 1990. • “Robust Algorithms for Detecting a Change in a Stochastic Process,” Department of Electrical Engineering, IIT Kanpur, February 1989 (sponsored by IEEE).
- “Robust Detection of a Change in a Stochastic Process,” Electrical Engineering Department, University of Alabama, Tuscaloosa, May 1988.
- “Robust Algorithms for Detecting a Change in a Stochastic Process,” Electrical and Computer Engineering Department, Washington State University, Pullman, July 1988.

**National Conference on Communications-2008 , IIT Bombay**

*on Universal Compression , the Entropy Rate and Hypothesis Testing An outline Entropy rate of a source and Shannon- McMillan- Breiman theorem for countable alphabet, Individual sequences- Ziv entropy, Lempel -Ziv complexity, Empirical entropy, Universal Compression , Existence of weakly universal , point-wise universal and strongly universal codes, Lempel-Ziv class of algorithms - Sliding Window algorithm , LZ-78 based on incremental parsing and their variations , asymptotic optimality and a comparative picture , Extension of LZ algorithms to countable alphabet, LZ based universal lossy compression algorithms, The redundancy rates of LZ algorithms, Universal Compression algorithms applied to hypothesis testing . Some open Problems. *

**National conference on Communications , 2005 IIT Kharagpur**

*Universal Source Coding and Data Compression 23 11th National Conference on Communications, NCC-2005, January 2005, Indian Institute of Technology Kharagpur, India. The document circulated contains 53 pages including references.*

**Conference presentations**

- “Sequential Change Detection using Empirical Distribution and Universal Codes,” 2022 International Symposium on Information Theory and its Applications , ( ISITA 2022 ) , Tsukuba, Japan, October 17- October 19, 2022 .
- ‘Sequential Change Detection Based on Universal Compression For Markov Sources,” 2019 IEEE International Symposium on Information Theory , ( ISIT ) , Paris, France, July 7- July 12, 2019.
- “Sequential Change Detection Through Universal Compression- An Asymptotic Study,” Proceedings of 2018 IEEE International Symposium on Information Theory , ( ISIT ) , Vail , Colorado, USA, June 17 -June 22, 2018.
- ‘On Optimality and Redundancy of Side Information Version of SWLZ,” 2017 IEEE International Symposium on Information Theory , ( ISIT ) , Aachen, Germany, June 25 to June 30 , 2017.
- ‘On Pointwise Redundancy Rate of Bender Wolf ’s Variant of SWLZ Algorithm,” 2016 IEEE Information Theory Workshop, ( ITW ) , University of Cambridge, UK, September 11 to 14 , 2016.
- “On the optimality of Sliding Window Lempel-Ziv algorithm with side information,” Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on 7-10 Dec. 2008, Auckland, New Zealand.
- “On Error Rate in Hypothesis Testing based on Universal Compression Algorithms,” 2006 IEEE Information Theory Workshop ( ITW’ 06 ), October 22-26, 2006 , Chengdu, China.
- “Weakly Universal LZ-Extended Codes for Countable Alphabet,” 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005.
- “Lossy Universal Coding for Individual Sequences,” IEEE Information Theory Workshop, Oct 20-25, 2002, Bangalore.
- “Importance Sampling through Distance Measures for Estimating the Probability of a Rare Event,” National Communications Conference, January 2000, Indian Institute of Technology, New Delhi.
- “Importance Sampling for the Estimation of Error Probabilities in Hall’s Minimum Probability Ratio Tests,” National Communications Conference, February 1997, Indian Institute of Technology, Madras.
- 12. “Sequential Detection of a Change in Distribution in a Nonparametric Framework,” National Communications Conference, February 1996, Indian Institute of Technology, Bombay. 25
- “Detecting a Change in a Binary Markov Process,” NACONECS-89 (National Conference on Circuits and Systems), Nov. 1989, University of Roorkee.
- “Robust Sequential or Fixed Sample Discrimination between two Stochastic Processes,” International Symposium on Probability and its Applications, August 1988, Fort Collins, Colorado.
- “On Extended Stopping Variables and the Ergodic Theorem,” International Conference on Almost Everywhere Convergence in Probability and Ergodic Theory, June 1988, Columbus, Ohio.
- “Robust Algorithms for Detecting a Change in a Stochastic Process with Infinite Memory,” Conference on Information Sciences and Systems, March 1988, Princeton University