Motivated by the field experimental designs in agriculture, the theory of block designs has been applied to several areas such as statistics, combinatorics, communication networks, distributed systems, cryptography, etc. An explicit formula and its fa...
Motivated by the field experimental designs in agriculture, the theory of block designs has been applied to several areas such as statistics, combinatorics, communication networks, distributed systems, cryptography, etc. An explicit formula and its fast computational algorithm for a class of symmetric balanced incomplete block designs are presented. Based on the formula and the careful investigation of the modulus multiplication table, the algorithm is developed. The computational costs of the algorithm is superior to those of the conventional ones.