Optimal codes for strong identification

DOI10.1006/EUJC.2002.0571MaRDI QIDQ1612759zbMATH OpenOpenAlexFDO

Authors Tero Laihonen

Publication date 19 May 2003

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/64c9a1c25ccb8db72880168c3b9294c7587b5856

zbMATH Keywords

fault detectionfaulty processorsstrongly identifying code

Mathematics Subject Classification ID

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

Recommendations

• Codes for strong identification
• Families of optimal codes for strong identification
• Two families of optimal identifying codes in binary Hamming spaces
• Sequences of optimal identifying codes
• scientific article; zbMATH DE number 2081125
• Optimal linear identifying codes
• On two variations of identifying codes
• On the identification of sets of points in the square lattice
• On codes identifying sets of vertices in Hamming spaces
• New bounds on binary identifying codes

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1424803 (Why is no real title available?)
• scientific article; zbMATH DE number 1436153 (Why is no real title available?)
• Bounds on identifying codes
• Codes for strong identification
• Families of optimal codes for strong identification
• General bounds for identifying codes in some infinite regular graphs
• On a new class of codes for identifying vertices in graphs
• On codes identifying sets of vertices in Hamming spaces
• On identifying codes
• On strongly identifying codes
• Sequences of optimal identifying codes
• Two families of optimal identifying codes in binary Hamming spaces

Cited in

(15)

• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
• A novel maximum distance separable code to generate universal identifiers
• Improved identification schemes based on error-correcting codes
• On identifying codes in binary Hamming spaces
• On robust and dynamic identifying codes
• On robust identification in the square and King grids
• Families of optimal codes for strong identification
• Locating-domination and identification
• Codes for strong identification
• On Iiro Honkala's contributions to identifying codes
• A class of I.P.P. codes with efficient identification
• On identifying codes that are robust against edge changes
• Sequences of optimal identifying codes
• scientific article; zbMATH DE number 2081125 (Why is no real title available?)
• Optimal linear identifying codes

This page was built for publication: Optimal codes for strong identification

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