Please use this identifier to cite or link to this item:
Title: Intrinsic order, lexicographic order, vector order and hamming weight
Authors: González, Luis 
UNESCO Clasification: 12 Matemáticas
Keywords: Complex stochastic Boolean system
Hamming weight
Intrinsic order
Intrinsic order graph
Lexicographic order
Vector order
Issue Date: 2012
Project: Avances en Simulación de Campos de Viento y Radiación Solar. 
Journal: IAENG International Journal of Computer Science 
Abstract: To compare binary n-tuple probabilities with no need to compute them, we have defined a partial order relation on the set {0, 1}n of all binary n-tuples: The so-called intrinsic order relation. In this paper, some properties of the intrinsic ordering are derived. These properties involve the lexicographic (truth-table) order in {0, 1}n, the vector order defined between the vectors of positions of 1-bits of the binary n-tuples, and the number of 1-bits in the binary n-tuples (i.e., the Hamming weights). These results are illustrated through simple examples and the intrinsic order graph.
ISSN: 1819-656X
Source: IAENG International Journal of Computer Science [ISSN 1819-656X], v. 39 (4), p. 377-385
Appears in Collections:Artículos
Show full item record

Page view(s)

checked on Feb 27, 2021

Google ScholarTM



Export metadata

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