The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used. It is thus equivalent to the Hamming distance from the all-zero string of the same length. For the most typical case, a string of bits, this is the number of 1's in the string. In this binary case, it is also called the population count, popcount or sideways sum. It is the digit sum of the binary representation of a given number.
Read more about Hamming Weight: Examples, History and Usage, Efficient Implementation, Language Support, Processor Support
Famous quotes containing the word weight:
“Not the less does nature continue to fill the heart of youth with suggestions of his enthusiasm, and there are now men,—if indeed I can speak in the plural number,—more exactly, I will say, I have just been conversing with one man, to whom no weight of adverse experience will make it for a moment appear impossible, that thousands of human beings might exercise towards each other the grandest and simplest of sentiments, as well as a knot of friends, or a pair of lovers.”
—Ralph Waldo Emerson (1803–1882)