On the persuadability of memory:is changing people's memories no more than changing their minds?

The observation of parallels between the memory distortion and persuasion literatures leads, quite logically, to the appealing notion that people can be 'persuaded' to change their memories. Indeed, numerous studies show that memory can be influenced and distorted by a variety of persuasive tactics, and the theoretical accounts commonly used by researchers to explain episodic and autobiographical memory distortion phenomena can generally predict and explain these persuasion effects. Yet, despite these empirical and theoretical overlaps, explicit reference to persuasion and attitude-change research in the memory distortion literature is surprisingly rare. In this paper, we argue that stronger theoretical foundations are needed to draw the memory distortion and persuasion literatures together in a productive direction. We reason that theoretical approaches to remembering that distinguish (false) beliefs in the occurrence of events from (false) memories of those events - compatible with a source monitoring approach - would be beneficial to this end. Such approaches, we argue, would provide a stronger platform to use persuasion findings to enhance the psychological understanding of memory distortion.

Weakly-constrained codes for suppression of patterning effects in digital communications

We propose weakly-constrained stream and block codes with tunable pattern-dependent statistics and demonstrate that the block code capacity at large block sizes is close to the the prediction obtained from a simple Markov model published earlier. We demonstrate the feasibility of the code by presenting original encoding and decoding algorithms with a complexity log-linear in the block size and with modest table memory requirements. We also show that when such codes are used for mitigation of patterning effects in optical fibre communications, a gain of about 0.5dB is possible under realistic conditions, at the expense of small redundancy 10%). © 2006 IEEE.

Weakly-constrained codes for suppression of patterning effects in digital communications

We propose weakly-constrained stream and block codes with tunable pattern-dependent statistics and demonstrate that the block code capacity at large block sizes is close to the the prediction obtained from a simple Markov model published earlier. We demonstrate the feasibility of the code by presenting original encoding and decoding algorithms with a complexity log-linear in the block size and with modest table memory requirements. We also show that when such codes are used for mitigation of patterning effects in optical fibre communications, a gain of about 0.5dB is possible under realistic conditions, at the expense of small redundancy (≈10%). © 2010 IEEE