Sciweavers

3508 search results - page 420 / 702
» Zero-Error Information Theory
Sort
View
CORR
2008
Springer
75views Education» more  CORR 2008»
15 years 6 months ago
A new probabilistic transformation of belief mass assignment
In this paper, we propose in Dezert-Smarandache Theory (DSmT) framework, a new probabilistic transformation, called DSmP, in order to build a subjective probability measure from an...
Jean Dezert, Florentin Smarandache
CORR
2008
Springer
95views Education» more  CORR 2008»
15 years 6 months ago
Depth as Randomness Deficiency
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 6 months ago
Conversion/Preference Games
We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. ...
Stéphane Le Roux, Pierre Lescanne, Ren&eacu...
EJC
2010
15 years 6 months ago
On the equivalence between real mutually unbiased bases and a certain class of association schemes
Mutually unbiased bases (MUBs) in complex vector spaces play several important roles in quantum information theory. At present, even the most elementary questions concerning the m...
Nicholas LeCompte, William J. Martin, William Owen...
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
15 years 6 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi