The maximum amount of information that can be stored, on the average, in each storage element, according to an associative scheme, has been measured for the memory model proposed by the author. In this model, the items being stored are coded by noise-like keys and the memory traces formed in this way are superimposed on the same storage elements. It will be shown that the problem of measuring the information retrieved from the memory in a single recall and the problem - concerning the data-communication field - of measuring the information transmitted over a noisy channel are formally similar. In particular, the Shannon noisy-channel coding theorem can find an application also in our case of an associative memory.
An after-shannon measure of the storage capacity of an associative noise-like coding memory
Bottini S
1986
Abstract
The maximum amount of information that can be stored, on the average, in each storage element, according to an associative scheme, has been measured for the memory model proposed by the author. In this model, the items being stored are coded by noise-like keys and the memory traces formed in this way are superimposed on the same storage elements. It will be shown that the problem of measuring the information retrieved from the memory in a single recall and the problem - concerning the data-communication field - of measuring the information transmitted over a noisy channel are formally similar. In particular, the Shannon noisy-channel coding theorem can find an application also in our case of an associative memory.File | Dimensione | Formato | |
---|---|---|---|
prod_419793-doc_148508.pdf
accesso aperto
Descrizione: An after-shannon measure of the storage capacity of an associative noise-like coding memory
Dimensione
1.88 MB
Formato
Adobe PDF
|
1.88 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.