It is well known that the NIST statistical test suite was used for the evaluation of AES candidate algorithms. We have found that the test setting of Discrete Fourier Transform test and Lempel-Ziv test of this test suite are wrong. We give four corrections of mistakes in the test settings. This suggests that re-evaluation of the test results should be needed.

This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n ≥ 2 and 0 £ x < 2 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2 n ) bit operations

Vol. XLIX (February 2012), 83 –91 *Femke van Horen is a postdoctoral researcher, Social Psychology Department, University of Cologne (e-mail: [email protected]). Rik Pieters is Professor of Marketing, Marketing Department, and Fellow at the Tilburg Institute of Behavioral and Economics Research (TIBER), Tilburg University (e-mail: [email protected]). This article is based on the first aut...

Zusammenfassung. In der Arbeit wird ein Netzwerkalgorithmus für die Kompression und die Rekonstruktion von DICOM-Bildern präsentiert. Der Algorithmus besteht aus zwei Teil: die Bitebenen des Originalbildes werden aufgrund einer vorläufigen Segmentation und Analyse des Bildinhaltes klassifiziert; auf Basis der Klassifikationsergebnisse wird das DICOM-Bild in zwei Bilder aufgeteilt. Danach werden...

Results on the parallel complexity of Lempel-Ziv data compression suggest that the sliding window method is more suitable than the LZW technique on shared memory parallel machines. When instead we address the practical goal of designing distributed algorithms with low communication cost, sliding window compression does not seem to guarantee robustness if we scale up the system. The possibility ...

We present a new on-line algorithm for computing the Lempel-Ziv factorization of a string that runs in O(N logN) time and uses only O(N log σ) bits of working space, where N is the length of the string and σ is the size of the alphabet. This is a notable improvement compared to the performance of previous on-line algorithms using the same order of working space but running in either O(N log3 N)...

For 30 years the Lempel-Ziv factorization LZx of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) in x. Traditionally the standard method for computing LZx was based on Θ(n)-time (or, depending on the measure used, O(n log n)-time) processing of the suffix tree STx of x. Recen...