Categories
  Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Weight (strings)

From HandWiki - Reading time: 1 min


The a-weight of a string, for a letter a, is the number of times that letter occurs in the string. More precisely, let A be a finite set (called the alphabet), aA a letter of A, and cA* a string (where A* is the free monoid generated by the elements of A, equivalently the set of strings, including the empty string, whose letters are from A). Then the a-weight of c, denoted by wta(c), is the number of times the generator a occurs in the unique expression for c as a product (concatenation) of letters in A.

If A is an abelian group, the Hamming weight wt(c) of c, often simply referred to as "weight", is the number of nonzero letters in c.

Examples

  • Let A={x,y,z}. In the string c=yxxzyyzxyzzyx, y occurs 5 times, so the y-weight of c is wty(c)=5.
  • Let A=𝐙3={0,1,2} (an abelian group) and c=002001200. Then wt0(c)=6, wt1(c)=1, wt2(c)=2 and wt(c)=wt1(c)+wt2(c)=3.



Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Weight_(strings)
88 views | Status: cached on January 22 2026 03:32:59
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF