Name
Abstract | ||
|---|---|---|
In a recent paper by Yaakobi and Bruck, the problem of information retrieval in associative memories has been considered. In an associative memory, each memory entry is associated to the neighboring entries. When searching information, a fixed number of input clues are given and the output set is formed by the entries associated to all the input clues. The maximum size of an output set is called the uncertainty of the associative memory. In this paper, we study the problem of information retrieval in associative memories with small uncertainty. In particular, we concentrate on the cases where the memory entries and their associations form a binary Hamming space or an infinite square grid. Particularly, we focus on minimizing the number of input clues needed to retrieve information with small uncertainty and present good constructions some of which are optimal, i.e., use the smallest possible number of clues. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/TIT.2013.2290045 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Hamming codes,binary codes,information retrieval,associative memory,binary Hamming space,fixed number,infinite square grid,information retrieval,small uncertainty,Covering code,Hamming space,associative memory,information retrieval,square grid | Hamming code,Square tiling,Associative property,Content-addressable memory,Information retrieval,Hamming(7,4),Computer science,Binary code,Theoretical computer science,Hamming space,Binary number | Journal |
Volume | Issue | ISSN |
60 | 2 | 0018-9448 |
Citations | PageRank | References |
3 | 0.46 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ville Junnila | 1 | 43 | 10.51 |
| Tero Laihonen | 2 | 363 | 39.39 |