The Hamming weight of a word over an alphabet with a distinguished zero symbol is the number of its nonzero coordinates. For a
binary word, it is the number of ones. Equivalently, it
is the Hamming distance from the all-zero word. For example, the binary word
10110 has Hamming weight 3.
Dzoba, C. "New Lower Bounds for Binary Constant-Weight Codes from Prescribed-Automorphism Search, and Two Quantum Codes Meeting Their Upper
Bounds." 16 Oct 2026. https://arxiv.org/abs/2610.24025.Huffman,
W. C. and Pless, V. Fundamentals of Error-Correcting Codes. Cambridge,
England: Cambridge University Press, 2003. https://doi.org/10.1017/CBO9780511807077.
