Bounds on identifying codes

DOI10.1016/S0012-365X(01)00113-3MaRDI QIDQ5951931zbMATH OpenWikidataFDO

Authors Uri Blass, Iiro Honkala, Simon Litsyn

Publication date 8 January 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00113-3

zbMATH Keywords

1-identifying codeslower bounds on the minimum cardinality

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Publication:4502621
• Upper bounds for binary identifying codes
• scientific article; zbMATH DE number 1522566
• New identifying codes in the binary Hamming space
• Construction of codes identifying sets of vertices

Cited in

(37)

• Upper bounds for binary identifying codes
• On \(r\)-locating-dominating sets in paths
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
• On the identification problems in products of cycles
• The minimum density of an identifying code in the king lattice.
• Optimal codes for strong identification
• Paths and cycles identifying vertices in twisted cubes
• A class of I.P.P. codes with efficient identification
• On the density of identifying codes in the square lattice
• Locating and identifying codes in circulant networks
• Locating sensors in paths and cycles: the case of 2-identifying codes
• Identifying codes of cycles
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• Codes for strong identification
• Edge identifying codes
• Liar's domination
• On robust and dynamic identifying codes
• scientific article; zbMATH DE number 1504659 (Why is no real title available?)
• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• \(r\)-identifying codes in binary Hamming space, \(q\)-ary Lee space and incomplete hypercube
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• On binary linear \(r\)-identifying codes
• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
• scientific article; zbMATH DE number 7655282 (Why is no real title available?)
• (r,k)-catching code
• Open neighborhood locating-dominating in trees
• Identifying codes and locating-dominating sets on paths and cycles
• On Iiro Honkala's contributions to identifying codes
• Optimal local identifying and local locating-dominating codes
• On identifying codes in binary Hamming spaces
• Linear and group identifying codes in Hamming graphs
• Constructing codes identifying sets of vertices
• On robust identification in the square and King grids
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
• New bounds on binary identifying codes
• Improved bounds on identifying codes in binary Hamming spaces
• New identifying codes in the binary Hamming space

This page was built for publication: Bounds on identifying codes

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