Permutation-invariant systems and their application in the filtering of finite discrete data

Interpreting sets of cyclic and dyadic shifts as specific examples of transitive abelian permutation groups, it is shown that every such group defines a class of permutation-invariant systems, which have structural properties analogous to those of the so-called cyclic and dyadic convolution systems, and which are likely to have similar applications in the filtering of finite discrete data.