New bounds on binary identifying codes

DOI10.1016/J.DAM.2007.09.017MaRDI QIDQ947104zbMATH OpenOpenAlexFDO

Authors Geoffrey Exoo, Tero Laihonen, Sanna Ranto

Publication date 29 September 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.09.017

zbMATH Keywords

Hamming spaceAsymptotic behaviourLower boundIdentifying code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60)

Recommendations

• Upper bounds for binary identifying codes
• Bounds on identifying codes
• New identifying codes in the binary Hamming space
• Improved bounds on identifying codes in binary Hamming spaces
• Revisiting and improving upper bounds for identifying codes
• On binary linear \(r\)-identifying codes
• On the size of identifying codes in binary hypercubes
• New upper bounds for binary covering codes
• New lower bounds for binary covering codes
• On identifying codes in binary Hamming spaces

Cites work

• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• scientific article; zbMATH DE number 1436153 (Why is no real title available?)
• Bounds on identifying codes
• Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)
• Extremal cardinalities for identifying and locating-dominating codes in graphs
• Improved Upper Bounds on Binary Identifying Codes
• On Identifying Codes in the Triangular and Square Grids
• On a new class of codes for identifying vertices in graphs
• On codes identifying sets of vertices in Hamming spaces
• On identifying codes in the hexagonal mesh
• On the density of identifying codes in the square lattice
• Sequences of optimal identifying codes
• Two families of optimal identifying codes in binary Hamming spaces

Cited in

(21)

• Bounds on \(r\)-identifying codes in \(q\)-ary Lee space
• Locating-domination and identification
• New identifying codes in the binary Hamming space
• New results in binary multiple descriptions
• A novel maximum distance separable code to generate universal identifiers
• Links Between Discriminating and Identifying Codes in the Binary Hamming Space
• Identifying codes and searching with balls in graphs
• New lower bound for 2-identifying code in the square grid
• On Iiro Honkala's contributions to identifying codes
• Optimal local identifying and local locating-dominating codes
• On the size of identifying codes in binary hypercubes
• Identifying codes in vertex-transitive graphs and strongly regular graphs
• Optimal codes for strong identification
• On codes identifying sets of vertices in Hamming spaces
• Bound of \(r\)-identifying and \(r\)-locating-dominating codes in the Kronecker product graph of \(cy_n\) and \(\overline{k}_2\)
• Sequences of optimal identifying codes
• Upper bounds for binary identifying codes
• On two variations of identifying codes
• Extension of universal cycles for globally identifying colorings of cycles
• Improved bounds on identifying codes in binary Hamming spaces
• Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes

This page was built for publication: New bounds on binary identifying codes

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