The problem of coding low-entropy information sources is considered. Since the run-length code was offered about 50 years ago by Shannon, it is known that for such sources there exist coding methods much simpler than for sources of a general type. However, known coding methods of low-entropy sources do not reach the given redundancy. In this correspondence, a new method of coding low-entropy so...

This paper is in the form of an essay. It defines fractal tops and code space structures associated with set-attractors of hyperbolic iterated function systems (IFSs). The fractal top of an IFS is associated with a certain shift invariant subspace of code space, whence the entropy of the IFS, and of its set-attractor, may be defined. Given any ordered pair of hyperbolic IFSs, each with the same...

This document describes a package of Python code for implementing various non-parametric continuous entropy estimators (and some discrete ones for convenience). After describing installation, Sec. 4 provides a wide-ranging discussion of technical, theoretical, and numerical issues surrounding entropy estimation. Sec. 5 provides references to the relevant literature for each estimator implemente...

In this paper we propose a revisitation of the topic of unique decodability and of some of the related fundamental theorems. It is widely believed that, for any discrete source X, every “uniquely decodable” block code satisfies E[l(X1, X2, · · · , Xn)] ≥ H(X1, X2, . . . , Xn), where X1, X2, . . . , Xn are the first n symbols of the source, E[l(X1, X2, · · · , Xn)] is the expected length of the ...

We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average length and exponential-average redundancy. The first of these relates to various problems involving queueing, uncertainty, and lossless communications, and it ...

The generic Huffman-Encoding Problem of finding a minimum cost prefix-free code is almost completely understood. There still exist many variants of this problem which are not as well understood, though. One such variant, requiring that each of the codewords ends with a “1,” has recently been introduced in the literature with the best algorithms known for finding such codes running in exponentia...

One of the main research topics in DNA computing is associated with the design of information encoding single or double stranded DNA strands that are “suitable” for computation. Double stranded or partially double stranded DNA occurs as a result of binding between complementary DNA single strands (A is complementary to T and C is complementary to G). This paper continues the study of the algebr...

Hawking's radiance, even as computed without account of backreaction, departs from blackbody form due to the mode dependence of the barrier penetration factor. Thus the radiation is not the maximal entropy radiation for given energy. By comparing estimates of the actual entropy emission rate with the maximal entropy rate for the given power, and using standard ideas from communication theory, w...

The analysis of cellular signaling cascades based on information thermodynamics has recently developed considerably. A signaling cascade may be considered a binary code system consisting of two types of signaling molecules that carry biological information, phosphorylated active, and non-phosphorylated inactive forms. This study aims to evaluate the signal transduction step in cascades from the...

Program protection, programming code integrity and intellectual property protection are important problems in embedded systems. Security mechanisms for embedded systems have some specific restrictions related to limited resources, bandwidth requirements and security. In this paper we develop a secret encryption key generation algorithm by using the signature of the embedded system. We explore t...