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. The theories and properties of relation operation are used, and discussed the issue, and proved the existence of optimal coding set, additionally provided the least number of coding set' s elements and the upper bound of filling times, and finally give optimal coding plan.%在信息采集卡的使用过程中,希望编码集的基本元素的个数最少,以增加信息容量,涂码的次数最少,以方便使用者.运用关系运算的理论和性质,在一般情况下讨论了这一问题,证明了最佳编码集的存在性,并给出了编码集的基本元素的最少个数及涂码次数的上界,并由此给出了最佳编码方案.
展开▼
