Two families of optimal identifying codes in binary Hamming spaces

DOI10.1109/18.995650MaRDI QIDQ4674500zbMATH OpenOpenAlexFDO

Authors Sanna Ranto, Tero Laihonen, Iiro Honkala

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.995650

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Other types of codes (94B60) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Families of optimal codes for strong identification
• Optimal linear identifying codes
• scientific article; zbMATH DE number 2081125
• Sequences of optimal identifying codes
• On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes

Cited in

(18)

• On the complexity of the identification problem in Hamming spaces
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• Optimal codes for strong identification
• Families of optimal codes for strong identification
• Paths and cycles identifying vertices in twisted cubes
• Codes for strong identification
• Liar's domination
• On the size of identifying codes in triangle-free graphs
• scientific article; zbMATH DE number 2159641 (Why is no real title available?)
• Optimal linear identifying codes
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• On Iiro Honkala's contributions to identifying codes
• On identifying codes in binary Hamming spaces
• On a new class of identifying codes in graphs
• Constructing codes identifying sets of vertices
• Codes identifying sets of vertices in random networks
• New bounds on binary identifying codes
• Improved bounds on identifying codes in binary Hamming spaces

This page was built for publication: Two families of optimal identifying codes in binary Hamming spaces

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