On some applications of the ag inequality in information theory.
In this series, this paper is devoted to the study of two related functional equations primarily connected with weighted entropy and weighted entropy of degree beta (which are weighted additive and weighted beta additive respectively) which include as special cases Shannon's entropy, inaccuracy (additive measures) and the entropy of degree beta (nonadditive) respectively. These functional equations which arise mainly from the representation and these 'additive' properties are solved for fixed m...
Partially supported by the Technical University of Gabrovo under Grant C-801/2008One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values of N(T, 1, 3) are known for...
The irregularity coefficient is one of the numerical characteristics of the spectral bandwith of a stationary random process. Its basic properties are investigated and the application to the dichotomic classification of a process into narrow-band and wide-band ones is given. Further, its behaviour is analyzed for sufficiently wide classes of stationary processes whose spectral densities frequently appear both in theory and applications.
We present a mathematical model allowing formally define the concepts of empirical and theoretical knowledge. The model consists of a finite set P of predicates and a probability space (Ω, S, P) over a finite set Ω called ontology which consists of objects ω for which the predicates π ∈ P are either valid (π(ω) = 1) or not valid (π(ω) = 0). Since this is a first step in this area, our approach is as simple as possible, but still nontrivial, as it is demonstrated by examples. More realistic approach...
In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data will be discussed. The classical CSK method determines the correct value of binary signal through checking which initially unsynchronized system is getting synchronized. On the contrary, the new anti-synchronization CSK (ACSK) scheme determines the wrong value of binary signal through checking which already synchronized system is loosing synchronization. The ACSK scheme is implemented...