Dominated error correcting codes with distance two
Dominated error correcting codes with distance two
复制标题
距离为二的主导纠错码
DOI：
10.1002/jcd.10012
复制
发表时间：
2002
影响因子：
0.7
通讯作者：
C. Colbourn
中科院分区：
文献类型：
--
作者：
F. Sagols;Laura P. Riccio;C. Colbourn
我们研究了从超立方体中获得的某些图的哈密顿性，作为产生距离为2且长度为n的二进制码的一种手段，其码字是有序的，使得对于每两个连续的码字，一个支配另一个。一个向量支配另一个向量，当且仅当，在所有一个向量为零的位置上，另一个向量也为零。这些支配码在连续缺陷的分组测试中有应用。我们还确定了向量何时可以排序，使得每两个连续的向量具有支配属性，并且距离为2;这是格雷码的自然推广。© 2002 Wiley Periodicals，Inc. J Combin Designs 10：294-302，2002;在线发表于Wiley InterScience（www.interscience.wiley.com）。DOI 10.1002/jcd.10012
We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length n, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector dominates the other, if and only if, in all the positions where one of them has a zero, the other has a zero too. These dominated codes have applications in group testing for consecutive defectives. We also determine when the vectors can be ordered so that every two consecutive vectors have the domination property, and are at distance two; this is a natural generalization of Gray codes. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 294–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10012