Abstract: Key distribution patterns (KDPs) are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. In this paper we discuss the close connection between resolvable designs and KDPs, and convert the constructions of KDPs into the constructions of resolvable designs. Finally, we give a construction of (q^2, q, 1)- ARBIBD and generalize it to constructions of resolvable design with qn (n is a integer and n ≥ 2) points by mathematical induction.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
Chen Shangdi, Wei Huihui, "Constructions for Key Distribution Pattern Using Resolvable Designs," WSEAS Transactions on Mathematics, vol. 13, pp. 59-68, 2014, DOI:
Chen Shangdi, Wei Huihui. Constructions for Key Distribution Pattern Using Resolvable Designs.
WSEAS Transactions on Mathematics. 2014;13:59-68.