Intrinsic order and hamming weight
Intrinsic order and hamming weight
The intrinsic order is a partial order relation defined on the set {0, 1} n of all binary n-tuples. This ordering enables one to automatically compare binary n-tuple probabilities without computing them, just looking at the relative positions of their 0s & 1s. In this paper, new relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. All theoretical results are rigorously proved and illustrated through the intrinsic order graph…
788
783
12 Matemáticas, Intrinsic order graph, 110202 Algebra de Boole, 1208 Probabilidad, Complex stochastic Boolean systems, 120808 Procesos estocásticos, Intrinsic order, Hamming weight
12 Matemáticas, Intrinsic order graph, 110202 Algebra de Boole, 1208 Probabilidad, Complex stochastic Boolean systems, 120808 Procesos estocásticos, Intrinsic order, Hamming weight
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!