On the Constructions of Constant-Weight Codes
On the Constructions of Constant-Weight Codes
复制标题
DOI：
10.1109/18.651060
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Fang-Wei Fu;A. Vinck;Shi-Yi Shen
中科院分区：
文献类型：
--
作者：
Fang-Wei Fu;A. Vinck;Shi-Yi Shen
给出了由GF(q)上的(1)码和GF(q)上的(2)定重码构造二元定重码的两种方法。利用这些方法导出了几种二元最优等权码。一般来说，我们证明了实现Johnson界的二元最优等权码可以由GF(q)上实现Plotkin界的最优码构造而成。最后，构造了GF(q)上的几类最优等权码。
Two methods of constructing binary constant-weight codes from (1) codes over GF(q) and (2) constant-weight codes over GF(q) are presented. Several classes of binary optimum constant-weight codes are derived from these methods. In general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, can be constructed from optimum codes over GF(q) which achieve the Plotkin bound. Finally, several classes of optimum constant-weight codes over GF(q) are constructed.