A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...

Biosemiotic entropy involves the deterioration of biological sign systems. The genome is a coded sign system that is connected to phenotypic outputs through the interpretive functions of the tRNA/ribosome machinery. This symbolic sign system (semiosis) at the core of all biology has been termed “biosemiosis”. Layers of biosemiosis and cellular information management are analogous in varying deg...

The development and application of various remote sensing platforms result in the production of huge amounts of satellite image data. Therefore, there is an increasing need for effective querying and browsing in these image databases. In order to take advantage and make good use of satellite images data, we must be able to extract meaningful information from the imagery. Hence we proposed a new...

It has been shown that the Kullback-Leibler divergence is a Lyapunov function for the replicator equations at evolutionary stable states, or ESS. In this paper we extend the result to a more general class of game dynamics. As a result, sufficient conditions can be given for the asymptotic stability of rest points for the entire class of incentive dynamics. The previous known results will be can...

Entropy-based measures have been widely deployed in anomaly detection systems (ADSes) to quantify behavioral patterns [1]. The entropy measure has shown significant promise in detecting diverse set of anomalies present in networks and end-hosts. We argue that the full potential of entropy-based anomaly detection is currently not being exploited because of its inefficient use. In support of this...

It is shown that there are arbitrarily long “good” (in the sense of Gilbert) binary block codes that are preserved under very large permutation groups. This result contrasts sharply with the properties of linear codes: it is conjectured that long cyclic codes are bad, and known that long al&e-invariant codes are bad. 1 T IS the object of this paper to show that there exist arbitrarily long bina...

We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding in channels with memory. The algorithm is based on the principle that the receiver rank orders noise sequences from most likely to least likely. Subtracting noise from the received signal in that order, the first instance that results in an element of the code-book is the ML decoding. For channels where the noise is ind...

Group-theoretic construction and analysis of generalized coset codes for symmetric/asymmetric distributed source coding. Abstract | In this paper we consider the problem of distributed source coding with symmetric and asym-metric rates of transmission with a constructive and practical approach, referred to as DIstributed Source Coding Using Syndromes (DISCUS). We employ generalized coset codes ...

The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...

Joint source-channel turbo techniques have recently been explored a lot in literature as one promising possibility to lower the end-to-end distortion, with fixed length codes, variable length codes, and (quasi) arithmetic codes. Still, many issues remain to be clarified before production use. This short contribution clarifies very concisely several issues that arise with EXIT charts and nonunif...