On the size of identifying codes

DOI10.1007/3-540-46796-3_14MaRDI QIDQ4502621zbMATH OpenFDO

Authors Uri Blass, Iiro Honkala, Simon Litsyn

Publication date 18 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46796-3_14

zbMATH Keywords

idnetifying codesminimum cardinality

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Bounds on identifying codes
• scientific article; zbMATH DE number 1522566
• Upper bounds for binary identifying codes
• Constructing codes identifying sets of vertices
• On identifying codes

Cited in

(17)

• Identifier length and limited programmer memory
• On the size of identifying codes in binary hypercubes
• Construction of codes identifying sets of vertices
• Fixed-parameter tractable algorithms for tracking shortest paths
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• Locating-domination and identification
• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• 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?)
• Bounds on identifying codes
• (r,k)-catching code
• On Iiro Honkala's contributions to identifying codes
• On the dimension of an APN code
• Constructing codes identifying sets of vertices
• Improved bounds on identifying codes in binary Hamming spaces
• New identifying codes in the binary Hamming space

This page was built for publication: On the size of identifying codes

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