Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/16446
Title: Intrinsic order and hamming weight
Authors: González, Luis 
UNESCO Clasification: 110202 Algebra de Boole
12 Matemáticas
120808 Procesos estocásticos
1208 Probabilidad
Keywords: Complex stochastic Boolean systems
Hamming weight
Intrinsic order
Intrinsic order graph
Issue Date: 2012
Journal: Lecture notes in engineering and computer science 
Abstract: 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…
URI: http://hdl.handle.net/10553/16446
ISBN: 9789881925213
ISSN: 2078-0958
Source: Lecture Notes in Engineering and Computer Science[ISSN 2078-0958],v. 2198, p. 783-788
Rights: by-nc-nd
Appears in Collections:Actas de congresos
Thumbnail
Adobe PDF (660,82 kB)
Show full item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.