Minimum number of input clues in robust information retrieval

DOI10.3233/FI-2016-1359zbMATH Open1371.68069OpenAlexW2508429415MaRDI QIDQ4976396FDOQ4976396

Authors Ville Junnila, Tero Laihonen 

Publication date 28 July 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2016-1359

zbMATH Keywords

robustnessinformation retrievalassociative memory\(k\)-factorJohnson bound

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Information retrieval and the average number of input clues
• Information retrieval with unambiguous output
• scientific article; zbMATH DE number 4085057
• Storage capacities of sparse associative memories
• The capacity of the Hopfield associative memory

Cited In (7)

• Information retrieval with unambiguous output
• Optimal bounds on codes for location in circulant graphs
• On \(t\)-revealing codes in binary Hamming spaces
• On regular and new types of codes for location-domination
• On a conjecture regarding identification in Hamming graphs
• Memory versus error trade-offs in binary-valued retrieval problems
• Information retrieval and the average number of input clues

This page was built for publication: Minimum number of input clues in robust information retrieval

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