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 13 Next

Displaying 241 – 260 of 269

Showing per page

On the Weight Distribution of the Coset Leaders of Constacyclic Codes

Velikova, Evgeniya, Bojilov, Asen (2008)

Serdica Journal of Computing

Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution...

On typical encodings of multivariate ergodic sources

Michal Kupsa (2020)

Kybernetika

We show that the typical coordinate-wise encoding of multivariate ergodic source into prescribed alphabets has the entropy profile close to the convolution of the entropy profile of the source and the modular polymatroid that is determined by the cardinalities of the output alphabets. We show that the proportion of the exceptional encodings that are not close to the convolution goes to zero doubly exponentially. The result holds for a class of multivariate sources that satisfy asymptotic equipartition...

On weighted entropy of type ( α , β ) and its generalizations

Gur Dial, Inder Jeet Taneja (1981)

Aplikace matematiky

Belis and Guiasu studied a generalization of Shannon entropy as weighted or useful entropy. In this paper, the weighted entropy of type ( α , β ) is defined and characterized and some if its properties are studied. Further generalizations involving more parameters of weighted entropy are also specified.

One-adhesive polymatroids

Laszlo Csirmaz (2020)

Kybernetika

Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized.

One-way communication complexity of symmetric boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2005)

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

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...

One-way communication complexity of symmetric Boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2010)

RAIRO - Theoretical Informatics and Applications

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...

Operations of Points on Elliptic Curve in Projective Coordinates

Yuichi Futa, Hiroyuki Okazaki, Daichi Mizushima, Yasunari Shidama (2012)

Formalized Mathematics

In this article, we formalize operations of points on an elliptic curve over GF(p). Elliptic curve cryptography [7], whose security is based on a difficulty of discrete logarithm problem of elliptic curves, is important for information security. We prove that the two operations of points: compellProjCo and addellProjCo are unary and binary operations of a point over the elliptic curve.

Optimal estimator of hypothesis probability for data mining problems with small samples

Andrzej Piegat, Marek Landowski (2012)

International Journal of Applied Mathematics and Computer Science

The paper presents a new (to the best of the authors' knowledge) estimator of probability called the "Epₕ√2 completeness estimator" along with a theoretical derivation of its optimality. The estimator is especially suitable for a small number of sample items, which is the feature of many real problems characterized by data insufficiency. The control parameter of the estimator is not assumed in an a priori, subjective way, but was determined on the basis of an optimization criterion (the least absolute...

Optimal Locating-Total Dominating Sets in Strips of Height 3

Ville Junnila (2015)

Discussiones Mathematicae Graph Theory

A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...

Optimal random sampling for spectrum estimation in DASP applications

Andrzej Tarczynski, Dongdong Qu (2005)

International Journal of Applied Mathematics and Computer Science

In this paper we analyse a class of DASP (Digital Alias-free Signal Processing) methods for spectrum estimation of sampled signals. These methods consist in sampling the processed signals at randomly selected time instants. We construct estimators of Fourier transforms of the analysed signals. The estimators are unbiased inside arbitrarily wide frequency ranges, regardless of how sparsely the signal samples are collected. In order to facilitate quality assessment of the estimators, we calculate...

Currently displaying 241 – 260 of 269