DOIAbstract
AbstractThe Witt formula determines (among other things) the number of words of fixed length from a finite alphabet that are not repeated concatenations of a shorter word. This provides an upper bound for the number of allowable words if every infinite string of words (with no indication of the gaps between words) can be uniquely decoded. We generalize the formula to one that is valid for any finite permutation group, not only cyclic groups, and show how it can be applied to lattice-like as well as string-like, codes
Add to ORKG