Bounds on r-identifying codes in q-ary Lee space

DOI10.11575/CDM.V16I1.62666zbMath1460.94089OpenAlexW3152594546MaRDI QIDQ4986273

Chinnapillai Durairajan, Dhanalakshmi Ramalingam

Publication date: 27 April 2021

Full work available at URL: https://cdm.ucalgary.ca/article/download/62666/54768

zbMATH Keywords

fault toleranceidentifying codesdirect sumcode construction\(q\)-ary hypercubes

Mathematics Subject Classification ID

Bounds on codes (94B65) Fault detection; testing in circuits and networks (94C12) Combinatorial codes (94B25)

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
• Identifying Codes and Covering Problems
• THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
• On a new class of codes for identifying vertices in graphs
• Introduction to Coding Theory

This page was built for publication: Bounds on r-identifying codes in q-ary Lee space