BIBDs algorithm

In this paper, we explore the planar near-rings to build BIBDs (Balanced Incomplete Block Designs) which is an important tool in the field of the theory of error-correcting code. Our purpose is to supply a program which determines BIBDs and their incidence matrices from a finite field, what gives us the possibility of choosing the best BIBD among the BIBDs obtained according to the values of its parameters.