Compression is beneficial because it helps detract resource usage. It reduces data storage space as well as transmission traffic and improves web pages loading. Run-length coding (RLC) is a lossless data compression algorithm. Data are stored as a data value and counts. This is useful on data that contains many consecutive runs. This paper proposes a compression algorithm using octonary repetit...

The existing optimal design of the fixed sampling interval S2-EWMA control chart to monitor the sample variance of a process is based on the average run length (ARL) criterion. Since the shape of the run length distribution changes with the magnitude of the shift in the variance, the median run length (MRL) gives a more meaningful explanation about the in-control and out-of-control performances...

We study arithmetic properties of a new tree-based canonical number representation, recursively run-length compressed natural numbers, defined by applying recursively a run-length encoding of their binary digits. We design arithmetic and boolean operations with recursively runlength compressed natural numbers that work a block of digits at a time and are limited only by the representation compl...

We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows an...

This paper presents a new pattern run-length compression method whose decompressor is simple and easy to implement. It encodes 2|n| runs of compatible or inversely compatible patterns, either inside a single test data segment or across multiple test data segments. Experimental results show that it can achieve an average compression ratio of 67.64% and considerable test application time savings.

This chapter presents a new encoding scheme called alternating frequency-directed equal-run-length (AFDER) coding for test data compression. This encoding scheme together with nine-coded compression technique enhance the test data compression ratio. In the first stage, the pre-generated test cubes with unspecified bits are encoded using nine-coded compression scheme. Later, the proposed encodin...

Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l+|Y |k) time algorithm that computes their edit distance.  2002 Elsevier Science B.V. All rights reserved.