Displaying 341 – 360 of 1507

Showing per page

Convexity inequalities for estimating generalized conditional entropies from below

Alexey E. Rastegin (2012)

Kybernetika

Generalized entropic functionals are in an active area of research. Hence lower and upper bounds on these functionals are of interest. Lower bounds for estimating Rényi conditional α -entropy and two kinds of non-extensive conditional α -entropy are obtained. These bounds are expressed in terms of error probability of the standard decision and extend the inequalities known for the regular conditional entropy. The presented inequalities are mainly based on the convexity of some functions. In a certain...

Creation of unequal error protection codes for two groups of symbols

Eugeniusz Kuriata (2008)

International Journal of Applied Mathematics and Computer Science

This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.

Cross-task code reuse in genetic programming applied to visual learning

Wojciech Jaśkowski, Krzysztof Krawiec, Bartosz Wieloch (2014)

International Journal of Applied Mathematics and Computer Science

We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from...

Cryptographic Primitives with Quasigroup Transformations

Mileva, Aleksandra (2010)

Mathematica Balkanica New Series

AMS Subj. Classification: Primary 20N05, Secondary 94A60The intention of this research is to justify deployment of quasigroups in cryptography, especially with new quasigroup based cryptographic hash function NaSHA as a runner in the First round of the ongoing NIST SHA-3 competition. We present new method for fast generation of huge quasigroup operations, based on the so-called extended Feistel networks and modification of the Sade’s diagonal method. We give new design of quasigroup based family of...

Cryptography based on number fields with large regulator

Johannes Buchmann, Markus Maurer, Bodo Möller (2000)

Journal de théorie des nombres de Bordeaux

We explain a variant of the Fiat-Shamir identification and signature protocol that is based on the intractability of computing generators of principal ideals in algebraic number fields. We also show how to use the Cohen-Lenstra-Martinet heuristics for class groups to construct number fields in which computing generators of principal ideals is intractable.

Currently displaying 341 – 360 of 1507