Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits

DOI10.1109/TIT.2016.2612234MaRDI QIDQ2976495zbMATH OpenOpenAlexFDO

Authors Farzad Farhadzadeh, Frans M. J. Willems

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2016.2612234

Mathematics Subject Classification ID

Information theory (general) (94A15)

Recommendations

• Capacity/Storage Tradeoff in High-Dimensional Identification Systems
• Memory versus error trade-offs in binary-valued retrieval problems
• scientific article; zbMATH DE number 1882050
• Memory lower bounds for randomized collaborative search and implications for biology
• Efficiency in the identification in the limit learning paradigm
• scientific article; zbMATH DE number 4070781
• Time of searching for similar binary vectors in associative memory
• Information storage and search complexity theory
• On the complexity of the identification problem in Hamming spaces
• Application of kolmogorov complexity to inductive inference with limited memory

Cited in

(1)

• A fixed rehearsal capacity interpretation of limits on absolute identification performance

This page was built for publication: Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits

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