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

02/21/2018
by   Tetsunao Matsuta, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2018

On the number of symbols that forces a transversal

Akbari and Alipour conjectured that any Latin array of order n with at l...
research
06/28/2019

Extending de Bruijn sequences to larger alphabets

A circular de Bruijn sequence of order n in an alphabet of k symbols is ...
research
06/10/2019

On Embedding De Bruijn Sequences by Increasing the Alphabet Size

The generalization of De Bruijn sequences to infinite sequences with res...
research
04/04/2019

Learning to Decipher Hate Symbols

Existing computational models to understand hate speech typically frame ...
research
07/06/2022

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

Locally repairable codes(LRCs) play important roles in distributed stora...
research
12/13/2018

On the Capacity of Locally Decodable Codes

A locally decodable code (LDC) maps K source symbols, each of size L_w b...
research
09/01/1997

Identifying Hierarchical Structure in Sequences: A linear-time algorithm

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

Please sign up or login with your details

Forgot password? Click here to reset