DeepAI AI Chat
Log In Sign Up

An Information-Theoretical Analysis of the Minimum Cost to Erase Information

by   Tetsunao Matsuta, et al.
Tokyo Institute of Technology

We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite the sequence of information with a sequence of symbols independent of the information. The overwriting is needed only at places where overwritten symbols are different from original symbols. Then, the cost of overwrites such as the number of overwritten symbols to erase information is important. In this paper, we clarify the minimum cost such as the minimum number of overwrites to erase information under weak and strong independence criteria. The former (resp. the latter) criterion represents that the mutual information between the original sequence and the overwritten sequence normalized (resp. not normalized) by the length of the sequences is less than a given desired value.


page 1

page 2

page 3

page 4


On the number of symbols that forces a transversal

Akbari and Alipour conjectured that any Latin array of order n with at l...

Extending de Bruijn sequences to larger alphabets

A circular de Bruijn sequence of order n in an alphabet of k symbols is ...

On Embedding De Bruijn Sequences by Increasing the Alphabet Size

The generalization of De Bruijn sequences to infinite sequences with res...

Learning to Decipher Hate Symbols

Existing computational models to understand hate speech typically frame ...

Some results on locally repairable codes with minimum distance 7 and locality 2

Locally repairable codes(LRCs) play important roles in distributed stora...

A construction of a λ- Poisson generic sequence

Years ago Zeev Rudnick defined the λ-Poisson generic sequences as the in...

Identifying Hierarchical Structure in Sequences: A linear-time algorithm

SEQUITUR is an algorithm that infers a hierarchical structure from a seq...