Links Between Discriminating and Identifying Codes in the Binary Hamming Space

DOI10.1007/978-3-540-77224-8_31zbMath1195.94081OpenAlexW1552276402MaRDI QIDQ5386104

Olivier Hudry, Irène Charon, Antoine C. Lobstein, Gérard D. Cohen

Publication date: 17 April 2008

Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_31

zbMATH Keywords

HypercubeGraph TheoryCoding TheoryDiscriminating CodesHamming SpaceIdentifying Codes

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Related Items (2)

Watching systems in graphs: an extension of identifying codes ⋮ Locating-Domination and Identification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discriminating codes in (bipartite) planar graphs
• On the complexity of the identification problem in Hamming spaces
• Discriminating codes in bipartite graphs
• Improved Upper Bounds on Binary Identifying Codes
• On a new class of codes for identifying vertices in graphs
• Bounds on identifying codes

This page was built for publication: Links Between Discriminating and Identifying Codes in the Binary Hamming Space