摘要
对于自然数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.
作者
蒋文丽
武小云
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)
出处
《数学的实践与认识》
2021年第5期323-328,共6页
Mathematics in Practice and Theory
基金
2016年度河北建筑工程学院校级科研基金项目(一般项目2016XJJYB06)。
关键词
二元等重码
最佳等重码
最佳检错码
binary constant weight codes
optimal constant weight codes
optimal errordetecting codes
