activity
20062025
most citedOn Match Lengths, Zero Entropy and Large Deviations - with Application to Sliding Window Lempel-Ziv Algorithm

2 citations · 3 across the 6 of their papers we have counts for

collaborators

6 papers

math.ST2025

Sequential Change Detection Under Markov Setup With Unknown Prechange And Postchange Distributions

Ashish Bhoopesh Gulaguli, Shashwat Singh, Rakesh Kumar Bansal

In this work we extend the results developed in 2022 for a sequential change detection algorithm making use of Page's CUSUM statistic, the empirical distribution as an estimate of…

cs.IT2021

Sequential Change Detection through Empirical Distribution and Universal Codes

Vikrant Malik, R. K. Bansal

Universal compression algorithms have been studied in the past for sequential change detection, where they have been used to estimate the post-change distribution in the modified v…

cs.IT2014★ 2 cited

On Match Lengths, Zero Entropy and Large Deviations - with Application to Sliding Window Lempel-Ziv Algorithm

Siddharth Jain, R. K. Bansal

The Sliding Window Lempel-Ziv (SWLZ) algorithm that makes use of recurrence times and match lengths has been studied from various perspectives in information theory literature. In…

cs.IT2013

On Match Lengths and the Asymptotic Behavior of Sliding Window Lempel-Ziv Algorithm for Zero Entropy Sequences

Siddharth Jain, Rakesh Kumar Bansal

The Sliding Window Lempel-Ziv (SWLZ) algorithm has been studied from various perspectives in information theory literature. In this paper, we provide a general law which defines th…

cs.IT2013★ 1 cited

On Large Deviation Property of Recurrence Times

Siddharth Jain, Rakesh Kumar Bansal

We extend the study by Ornstein and Weiss on the asymptotic behavior of the normalized version of recurrence times and establish the large deviation property for a certain class of…

cs.IT2006

A Coding Theorem Characterizing Renyi's Entropy through Variable-to-Fixed Length Codes

Vaneet Aggarwal, R. K. Bansal

This paper has been withdrawn