Optimal linear identifying codes

DOI10.1109/TIT.2003.810657MaRDI QIDQ4680118zbMATH OpenOpenAlexFDO

Authors Sanna Ranto

Publication date 1 June 2005

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

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

Mathematics Subject Classification ID

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

Recommendations

• Optimal codes for strong identification
• Families of optimal codes for strong identification
• Sequences of optimal identifying codes
• Improved bounds on identifying codes in binary Hamming spaces
• Two families of optimal identifying codes in binary Hamming spaces

Cited in

(10)

• Optimal codes for strong identification
• Locating-domination and identification
• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• Sequences of optimal identifying codes
• Two families of optimal identifying codes in binary Hamming spaces
• On binary linear \(r\)-identifying codes
• On codes identifying sets of vertices in Hamming spaces
• On full-separating sets and related codes in graphs
• Linear and group identifying codes in Hamming graphs
• Improved bounds on identifying codes in binary Hamming spaces

This page was built for publication: Optimal linear identifying codes

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