2 citations · 3 across the 6 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…
A Coding Theorem Characterizing Renyi's Entropy through Variable-to-Fixed Length Codes
Vaneet Aggarwal, R. K. Bansal
This paper has been withdrawn