On binary linear r-identifying codes

DOI10.1007/S10623-010-9418-4MaRDI QIDQ540477zbMATH OpenOpenAlexFDO

Authors Sanna Ranto

Publication date 3 June 2011

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-010-9418-4

zbMATH Keywords

identifying codeslinear codesHamming space

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05) Fault detection; testing in circuits and networks (94C12)

Recommendations

• On identifying codes in binary Hamming spaces
• Optimal linear identifying codes
• New identifying codes in the binary Hamming space
• Upper bounds for binary identifying codes
• Improved bounds on identifying codes in binary Hamming spaces

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• scientific article; zbMATH DE number 1436153 (Why is no real title available?)
• Bounds on identifying codes
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Improved Upper Bounds on Binary Identifying Codes
• Improved bounds on identifying codes in binary Hamming spaces
• Monotonicity of the minimum cardinality of an identifying code in the hypercube
• New identifying codes in the binary Hamming space
• On a new class of codes for identifying vertices in graphs
• On identifying codes in binary Hamming spaces
• Optimal linear identifying codes

Cited in

(12)

• scientific article; zbMATH DE number 1522566 (Why is no real title available?)
• On identifying codes in binary Hamming spaces
• scientific article; zbMATH DE number 5228468 (Why is no real title available?)
• Improved bounds on identifying codes in binary Hamming spaces
• On the size of identifying codes in binary hypercubes
• Locating-domination and identification
• New bounds on binary identifying codes
• Partial linear spaces and identifying codes
• Constellation labeling for linear encoders
• Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes
• A class of I.P.P. codes with efficient identification
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space

This page was built for publication: On binary linear \(r\)-identifying codes

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