Sequences of optimal identifying codes

DOI10.1109/18.986043MaRDI QIDQ4544828zbMATH OpenOpenAlexFDO

Authors Tero Laihonen

Publication date 4 August 2002

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

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

Mathematics Subject Classification ID

Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Fault detection; testing in circuits and networks (94C12)

Recommendations

• scientific article; zbMATH DE number 2081125
• Optimal codes for strong identification
• On cages admitting identifying codes
• Optimal linear identifying codes
• New bounds on binary identifying codes

Cited in

(25)

• Upper bounds for binary identifying codes
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• On the identification problems in products of cycles
• Optimal codes for strong identification
• Paths and cycles identifying vertices in twisted cubes
• Constructions of r-identifying codes and (r, l)-identifying codes
• On identifying codes that are robust against edge changes
• Locating-domination and identification
• scientific article; zbMATH DE number 4168387 (Why is no real title available?)
• On robust and dynamic identifying codes
• Optimal identification of sets of edges using 2-factors
• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• scientific article; zbMATH DE number 2159641 (Why is no real title available?)
• Two families of optimal identifying codes in binary Hamming spaces
• Optimal linear identifying codes
• On codes identifying sets of vertices in Hamming spaces
• Upper bounds on the length function for covering codes with covering radius R and codimension tR+1
• On Iiro Honkala's contributions to identifying codes
• On identifying codes in binary Hamming spaces
• On a new class of identifying codes in graphs
• On robust identification in the square and King grids
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• Sequence matching with binary codes
• New bounds on binary identifying codes
• Improved bounds on identifying codes in binary Hamming spaces

This page was built for publication: Sequences of optimal identifying codes

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