In the application of information sheets, to minimize the number of basic elements can increase the information capacity of information sheet. Meanwhile, to minimize the times of filling information sheet can bring convenience to the users. This article uses the theories and properties of relation operation, and discusses the issue, and proves the existence of optimal coding set, additionally provides the least number of coding set’s elements and the upper bound of filling times, and finally gives optimal coding plan.