The Hamming weight of a string is the number of symbols in it that differ from the zero symbol of its alphabet, making it equivalent to the Hamming distance between that string and an all-zero string of the same length. For a sequence of bits, the Hamming weight is the count of bits set to 1, also called the digit sum of the binary representation and the L1 norm of the bit vector; in this binary case it is also known as the population count, popcount, sideways sum, or bit summation. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Attributed To
Source Hamming Weight (Wikipedia)
Is Kind Of Object
Sources
1. Hamming Weight (Wikipedia)
Lead section
The Hamming weight of a string is the number of symbols that are different from the zero-symbol of the alphabet used.
Attributed To: Richard Hamming, Lead
The Hamming weight is named after the American mathematician Richard Hamming, although he did not originate the notion
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.