Dominated error correcting codes with distance two

DOI10.1002/JCD.10012MaRDI QIDQ3150163zbMATH OpenOpenAlexFDO

Authors Feliú Sagols, Laura Riccio, Charles J. Colbourn

Publication date 29 September 2002

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.10012

zbMATH Keywords

error correcting codeshypercubes

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Hamilton paths in dominating graphs of trees and cycles
• Disjoint Hamiltonian cycles in minimum distance graphs of 1-perfect codes
• Short dominating paths and cycles in the binary hypercube
• Gray codes with restricted density
• Hamiltonicity of minimum distance graphs of 1-perfect codes

Cited in

(3)

• Consecutive positive detectable matrices and group testing for consecutive positives.
• Cyclic sequences of k-subsets with distinct consecutive unions
• Dominance graph of binary words

This page was built for publication: Dominated error correcting codes with distance two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150163)