Dominated error correcting codes with distance two

Feliú Sagols; Laura P. Riccio; Charles Colbourn

doi:10.1002/jcd.10012

Dominated error correcting codes with distance two

Feliú Sagols, Laura P. Riccio, Charles Colbourn

IAFSE-CIDSE: Computer Science and Engineering

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	294-302
Number of pages	9
Journal	Journal of Combinatorial Designs
Volume	10
Issue number	5
DOIs	https://doi.org/10.1002/jcd.10012
State	Published - Dec 1 2002

Keywords

Error correcting code
Hamiltonian cycle
Nonadaptive group testing

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1002/jcd.10012

Fingerprint Dive into the research topics of 'Dominated error correcting codes with distance two'. Together they form a unique fingerprint.

Cite this

@article{fb5f76b01e4547b8b0b3d42e7aab3fba,

title = "Dominated error correcting codes with distance two",

abstract = "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.",

keywords = "Error correcting code, Hamiltonian cycle, Nonadaptive group testing",

author = "Feli{\'u} Sagols and Riccio, {Laura P.} and Charles Colbourn",

year = "2002",

month = dec,

day = "1",

doi = "10.1002/jcd.10012",

language = "English (US)",

volume = "10",

pages = "294--302",

journal = "Journal of Combinatorial Designs",

issn = "1063-8539",

publisher = "John Wiley and Sons Inc.",

number = "5",

}

TY - JOUR

T1 - Dominated error correcting codes with distance two

AU - Sagols, Feliú

AU - Riccio, Laura P.

AU - Colbourn, Charles

PY - 2002/12/1

Y1 - 2002/12/1

N2 - 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.

AB - 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.

KW - Error correcting code

KW - Hamiltonian cycle

KW - Nonadaptive group testing

UR - http://www.scopus.com/inward/record.url?scp=0345017666&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0345017666&partnerID=8YFLogxK

U2 - 10.1002/jcd.10012

DO - 10.1002/jcd.10012

M3 - Article

AN - SCOPUS:0345017666

VL - 10

SP - 294

EP - 302

JO - Journal of Combinatorial Designs

JF - Journal of Combinatorial Designs

SN - 1063-8539

IS - 5

ER -

Dominated error correcting codes with distance two

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this