r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube

DOI10.1142/S1793830919500277zbMath1454.94140OpenAlexW2917172636MaRDI QIDQ4634300

No author found.

Publication date: 7 May 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830919500277

zbMATH Keywords

identifying codesdirect sumcode constructionincomplete hypercubesbinary Hamming spacesq-ary Lee spaces

Mathematics Subject Classification ID

Bounds on codes (94B65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fault detection; testing in circuits and networks (94C12)

Related Items (1)

Progress on fault-tolerant locating-dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on identifying codes in binary Hamming spaces
• New identifying codes in the binary Hamming space
• On the complexity of the identification problem in Hamming spaces
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• Identifying Codes and Covering Problems
• On a new class of codes for identifying vertices in graphs
• Introduction to Coding Theory
• Bounds on identifying codes

This page was built for publication: r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube