Information retrieval and the average number of input clues

DOI10.3934/amc.2017013zbMath1404.68039OpenAlexW2588773401MaRDI QIDQ514538

Tero Laihonen

Publication date: 9 March 2017

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2017013

zbMATH Keywords

information retrievalassociative memorygeometric methodking grid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)

Related Items

On \(t\)-revealing codes in binary Hamming spaces ⋮ Locating-Domination and Identification

Cites Work

• Unnamed Item
• Adaptive identification in Torii in the King lattice
• The minimum density of an identifying code in the king lattice.
• Information retrieval with unambiguous output
• Watching systems in the King grid
• New results on variants of covering codes in Sierpiński graphs
• Extremal graphs for the identifying code problem
• Information Retrieval With Varying Number of Input Clues
• On codes identifying vertices in the two-dimensional square lattice with diagonals
• On a new class of codes for identifying vertices in graphs
• Connected Identifying Codes
• Codes for Information Retrieval With Small Uncertainty