 Binary Galois LFSRs like the ones shown above can be generalized to any "q"-ary alphabet {0, 1, ..., "q" − 1} (e.g., for binary, "q" = 2, and the alphabet is simply {0, 1}).In this case, the exclusive-or component is generalized to addition modulo-"q" (note that XOR is addition modulo 2), and the feedback bit (output bit) is multiplied (modulo-"q") by a "q"-ary value, which is constant for each specific tap point.Note that this is also a generalization of the binary case, where the feedback is multiplied by either 0 (no feedback, i.e., no tap) or 1 (feedback is present).