Internet security applications of the Munn rings (Q5962333)

Effective multiple clustering systems, or clusterers, have important applications in information security. The aim of the present article is to introduce a new method of designing multiple clusterers based on the Munn rings (A \textit{Munn ring} over ring \(R\) with sandwich matrix \(P\) is the set \(M(R;I,\Lambda;P)\), consisting of all \(I\times\Lambda\) matrices with a finite number of nonzero entries over \(R\), equipped with the usual addition and multiplication \(\cdot\) defined by \(A\cdot B=APB\)) and describe a class of optimal clusterers which can be obtained in this construction. Theorems proven in the paper characterize an optimal class of multiple clusterers of large weight, which can be used by other researchers in the design of experiments.