The radial entropy profile of the hot gas in clusters of galaxies tends to follow a power law in radius outside of the cluster core. Here we present a simple formula giving both the normalization and slope for the power-law entropy profiles of clusters that form in the absence of non-gravitational processes such as radiative cooling and subsequent feedback. It is based on seventy-one clusters d...

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

We present a theoretical as well as experimental investigation of a population of self-replicating segments of code subject to random mutation and survival of the ttest. Under the assumption that such a system constitutes a minimal system with characteristics of life, we obtain a number of statements on the evolution of complexity and the trade-oo between entropy and information.

In this paper we have established relations of the genetic tables with magic and bimagic squares. Connections with Hamming distances, binomial coefficients are established. The idea of Gray code is applied. Shannon entropy of magic squares of order 4 × 4, 8 × 8 and 16 × 16 are also calculated. Some comparison is also made. Symmetry among restriction enzymes having four letters is also studied.

A new measure Lα, called average code word length of order α and type β has been defined and its relationship with a result of generalized Havrda and Charvat and Tsallis’s entropy has been discussed. Using Lα, some coding theorem for discrete noiseless channel has been proved.

This paper examines the use of arithmetic coding in conjunction with the error resilient entropy code (EREC). The constraints on the coding model are discussed and simulation results are presented and compared to those obtained using Huffman coding. These results show that without the EREC, arithmetic coding is less resilient than Huffman coding, while with the EREC both systems yield comparabl...

Encoding and indexing of lattice codes is generalized from self-similar lattice codes to a broader class of lattices. If coding lattice Λc and shaping lattice Λs satisfy Λs Ď Λc, then Λc{Λs is a quotient group that can be used to form a (nested) lattice code C. Conway and Sloane’s method of encoding and indexing does not apply when the lattices are not self-similar. Results are provided for two...

This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the transmitted codeword given the received sequence at the output of the parallel channels; the component channels are considered to be memoryless, binary-input, ...

Neural encoding and decoding focus on the question: " What does the response of a neuron tell us about a stimulus ". In this chapter we consider a related but different question: " How much does the neural response tell us about a stimulus ". The techniques of information theory allow us to answer this question in a quantitative manner. Furthermore, we can use them to ask what forms of neural r...

Accurate classification of dialog acts (DAs) is important for many spoken language applications. Different methods have been proposed such as hidden Markov models (HMM), maximum entropy (Maxent), graphical models, and support vector machines (SVMs). In this paper, we investigate using SVMs for multiclass DA classification in the ICSI meeting corpus. We evaluate (1) representing DA tagging direc...