Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely stored in traditional databases, and instead must be processed “on the fly” as they are produced. Similarly, sensor networks produce multiple data streams of observations from their sensors. There is growing focus on ma...

It is proved that codes of length n, covering radius Z?, and minimum Hamming distance 2R-1 are normal if R does not divide n. Constructions for abnormal codes with covering radius R and minimum Hamming distance at least R-l are given.

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

We describe a new statistical test for pseudorandom number generators (PRNGs). Our can find bias induced by dependencies among the Hamming weights of outputs PRNG, even PRNGs that pass state-of-the-art tests same kind from literature, and particularly based on F 2 -linear transformations such as dSFMT [ 22 ], xoroshiro1024+ 1 WELL512 19 ].