摘要
本文给出(n,6,m)(m≥6)等重等距码的一种构造方法,侧重讨论了(n,6,m)等重等距码的基本结构形式,设计了几类可以用来构造(n,6,m)等重等距码的基本单元子块,并分析了构造原则和实现结果,以及置换个数和性能分析。
In this paper, a constituting method of binary codes of constant weight and distance with parameters (n,6,m)(m ≥6) is given. The basic structure form of this kind of codes is discussed and the subset block of basic unit which can be used to constitute this kind of codes is designed. The constituting rule and realization result are analysed. Finally, the numbers of permutations and the properties of error-detecting codes are discussed.
关键词
等重等距码
窗口码矩阵
子块阵列
检错码
Binary codes of constant weight and distance, Window codes matrix, Subset block array, Permutations combination, Error-detecting codes
