基于有限集[N]上相交关系构作的二元等重码  

Construction of a Binary Constant Weight Code Based on Intersection Relation of Subsets in the Finite Set[N]

作　　者：蒋文丽 武小云[2] JIANG Wen-li;WU Xiao-yun(Department of Public Basic Courses Teaching,Zhengzhou Technology and Business University,Zhengzhou 450000,China;Department of Science,Hebei Institute of Architecture&Civil Engineering,Zhangjiakou 075000,China)

机构地区：[1]郑州工商学院公共基础教学部,河南郑州450000 [2]河北建筑工程学院数理系,河北张家口075000

出　　处：《数学的实践与认识》2021年第5期323-328,共6页Mathematics in Practice and Theory

基　　金：2016年度河北建筑工程学院校级科研基金项目(一般项目2016XJJYB06)。

摘　　要：对于自然数s,r,k,N,0<s≤r<k≤N,根据基集[N]={1,2,…,Ν}上两个不同子集的相交关系构作了一个关联矩阵,证明了这个关联矩阵是一个二元等重码,给出了它成为最佳等重码的条件,研究了它的检错性.For natural numbers s,r,k,N,0<s≤r<k≤N,r,k∈[N]={1,2,…,Ν}.A relation matrix is constructed by intersection relation of two different subsets in[N]subsets.Proved that this relation matrix is a binary constant weight code and obtained conditions of optimal constant weight code and studied its error-detecting properties.

关 键 词：二元等重码 最佳等重码 最佳检错码 

分 类 号：O151.21[理学—数学]