On minimal length factorizations of finite groups.
On minimal logarithmic signatures of finite groups.
On minimal redundancy codes.
A code X over the alphabet A is complete if the submonoid X* generated by X meets all two-sided ideals of A*. If one measures the cost of a finite code X over A, with respect to a given information source S, by the quantity gamma(X) = <X> ln |A|, we say that X is completely optimal for S if it does not exist any code X', over an arbitrary alphabet, such that gamma (X') < gamma (X). One can show that for |X| ≤ 5 a completely optimal code has to be complete. However for |X| >...
On mixed codes with covering radius 1 and minimum distance 2.
On Multiple Deletion Codes
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion codes...
On multiscale denoising of spherical functions: basic theory and numerical aspects.
On network models and the symbolic solution of network equations
This paper gives an overview of the formulation and solution of network equations, with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If necessary, the network graph is modified so as to obtain an admittance representation for all kinds of multi-ports. N-dimensional networks are...
On networks of non-deterministic automata
On non-additive measures of inaccuracy
On nonblocking and rearrangeable communication graphs
On nonlinear complexity of monotone realization of a family of Boolean sums.
On optimal linear codes over .
On perfect-like binary and non-binary linear codes - a brief survey.
On pointwise adaptive curve estimation based on inhomogeneous data
We want to recover a signal based on noisy inhomogeneous data (the amount of data can vary strongly on the estimation domain). We model the data using nonparametric regression with random design, and we focus on the estimation of the regression at a fixed point x0 with little, or much data. We propose a method which adapts both to the local amount of data (the design density is unknown) and to the local smoothness of the regression function. The procedure consists of a local polynomial...
On positive, linear and quadratic Boolean functions
On Proactive Verifiable Secret Sharing Schemes
The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakaloff , Sofia, July, 2006. The material in this paper was presented in part at the 11th Workshop on Selected Areas in Cryptography (SAC) 2004This paper investigates the security of Proactive Secret Sharing Schemes. We first consider the approach of using commitment to 0 in the renewal phase in order to refresh the player's shares and we present two types of...
On probability of first order formulas in a given model
On quadratic Hurwitz forms. I
Homogeneous quadratic polynomials in complex variables are investigated and various necessary and sufficient conditions are given for to be nonzero in the set . Conclusions for the theory of multivariable positive real functions are formulated with applications in multivariable electrical network theory.
On -fuzzy Petri nets.
On real quadratic number fields suitable for cryptography.