A family of perpendicular arrays achieving perfect 4-fold secrecy
A perpendicular array \(\text{PA}_ \lambda(t,k,v)\) is a \(\lambda{v\choose t}\) by \(k\) array of \(t\) distinct symbols, satisfying that (1) every row has \(k\) distinct symbols, and (2) for any \(t\) columns and for any \(t\) distinct symbols, there exist exactly \(\lambda\) rows with the given symbols in the given columns. A perpendicular array \(\text{PA}_ \lambda(t,k,v)\) is inductive if it is also a \(\text{PA}_{\lambda(s)}(t,k,v)\) for any \(s< t\), where \(\lambda(s)= \lambda{v-s\choose t-s}\Bigl/{t\choose s}\). In this paper, the author constructed inductive PAs for \(t= 4\).
scientific article; zbMATH DE number 562647