All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 50 Next

Displaying 981 – 1000 of 1497

Showing per page

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn is edge-hy per-...

On the Error-Correcting Performance of some Binary and Ternary Linear Codes

Baicheva, Tsonka (2007)

Serdica Journal of Computing

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear...

On the fundamentals of fuzzy sets.

Robert Lowen (1984)

Stochastica

A considerable amount of research has been done on the notions of pseudo complement, intersection and union of fuzzy sets [1], [4], [11]. Most of this work consists of generalizations or alternatives of the basic concepts introduced by L. A. Zadeh in his famous paper [13]: generalization of the unit interval to arbitrary complete and completely distributive lattices or to Boolean algebras [2]; alternatives to union and intersection using the concept of t-norms [3], [10]; alternative complements...

On the g -entropy and its Hudetz correction

Beloslav Riečan (2002)

Kybernetika

The Hudetz correction of the fuzzy entropy is applied to the g -entropy. The new invariant is expressed by the Hudetz correction of fuzzy entropy.

On the generators of T-indistinguishability operator.

Joan Jacas (1988)

Stochastica

The structure of the generators' set of a T-indistinguishability operator is analyzed. A suitable characterization of such generators is given. T-indistinguishability operators generated by a single fuzzy set, in the sense of the representation problem, are studied.

On the invertibility of finite linear transducers

Ivone Amorim, António Machiavelo, Rogério Reis (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Linear finite transducers underlie a series of schemes for Public Key Cryptography (PKC) proposed in the 90s of the last century. The uninspiring and arid language then used, condemned these works to oblivion. Although some of these schemes were afterwards shown to be insecure, the promise of a new system of PKC relying on different complexity assumptions is still quite exciting. The algorithms there used depend heavily on the results of invertibility of linear transducers. In this paper we introduce...

On the Jensen-Shannon divergence and the variation distance for categorical probability distributions

Jukka Corander, Ulpu Remes, Timo Koski (2021)

Kybernetika

We establish a decomposition of the Jensen-Shannon divergence into a linear combination of a scaled Jeffreys' divergence and a reversed Jensen-Shannon divergence. Upper and lower bounds for the Jensen-Shannon divergence are then found in terms of the squared (total) variation distance. The derivations rely upon the Pinsker inequality and the reverse Pinsker inequality. We use these bounds to prove the asymptotic equivalence of the maximum likelihood estimate and minimum Jensen-Shannon divergence...

On the joint 2-adic complexity of binary multisequences

Lu Zhao, Qiao-Yan Wen (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences with given joint 2-adic complexity.

On the joint 2-adic complexity of binary multisequences∗

Lu Zhao, Qiao-Yan Wen (2012)

RAIRO - Theoretical Informatics and Applications

Joint 2-adic complexity is a new important index of the cryptographic security for multisequences. In this paper, we extend the usual Fourier transform to the case of multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for the multisequences with pn-period, we discuss the relation between sequences and their Fourier coefficients. Based on the relation, we determine a lower bound for the number of multisequences...

Currently displaying 981 – 1000 of 1497