Covering a Square by Small Perimeter Rectangles.
Covering codes for Hats-on-a-line.
Creation of unequal error protection codes for two groups of symbols
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.
Criptografía y curvas elípticas.
Crittografia a chiave pubblica: la matematica pura applicata al mondo reale
Cross-correlation properties of Costas arrays and their images under horizontal and vertical flips.
Cross-task code reuse in genetic programming applied to visual learning
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...
Cryptanalysis and improvement of a block cipher based on multiple chaotic systems.
Cryptanalysis of a chaotic communication scheme using parameter observer.
Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials
Cryptographic Primitives with Quasigroup Transformations
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
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.
Cryptography through Interpolation, Approximation and Computational Intelligence methods
Cryptographycal protocols in the Egerfood Information System.
Cube-Tilings of Rn and Nonlinear Codes.
Curvature in image and shape processing
The laplacian operator applied to the coordinates of a manifold provides the mean curvature vector. Manipulating the metric of the manifold or interpreting its coordinates in various ways provide useful tools for shape and image processing and representation. We will review some of these tools focusing on scale invariant geometry, curvature flow with respect to an embedding of the image manifold in a high dimensional space, and object segmentation by active contours defined via the shape laplacian...
Curve cuspless reconstruction via sub-riemannian geometry
We consider the problem of minimizing ∫ 0 ℓ ξ 2 + K 2 ( s ) d s for a planar curve having fixed initial and final positions and directions. The total lengthℓ is free. Here s is the arclength parameter, K(s) is the curvature of the curve and ξ > 0 is a fixed constant. This problem comes from a model of geometry of vision due to Petitot, Citti and Sarti. We study existence of local and global minimizers for this problem. We prove that if for a certain choice of boundary conditions there...
Cycle indicators of linear groups and enumeration of linear codes. (Zyklenzeiger linearer Gruppen und Abzählung linearer Codes.)
Data compression in discriminating stochastic processes
De Bruijn cycles and their application for encoding of discrete positions