Consider the following code. The legal codewords are those 32-bit sequences in which the number of 1-bits is divisible by 6. That is, a codeword is legal if it is 32-bit long, and of these bits the number of 1-bits is 0, 6, 12, 18, 24, or 30. How much is the Hamming distance of this code, and how many single bit errors can this code detect and correct?

B. short-term memory serves as an intermediate store between sensory memory and long-term memory.

Explanation:

The Atikinson & Shiffrin (1968) view of memory is based on a computer metaphor of the mind -- although its roots go back to William James (1890). The model is defined below:

1. Incoming sensory information is initially held in the sensory registers.

2. By means of attention, some information is transferred to short-term memory.

3. Information is maintained in short-term memory by means of rehearsal. If the information in short-term memory receives enough rehearsal, it is copied into long-term memory by means of certain encoding processes.

4. Information can be transferred from long-term memory back to short term memory by means of certain retrieval processes.

5. Information in long-term memory is also used to support pattern-recognition processes in the sensory registers.