What people are saying - Write a review
We haven't found any reviews in the usual places.
SingleUser Distributed Information Storage
Multiple Users with Common Information
4 other sections not shown
2t bits achievable admit sequential reﬁnement assume asymptotic equipartition property attached to User bits of information blocks per track capacity region Chapter complete sequential reﬁnement compute consider data and parity data blocks data tracks deﬁne deﬁnition delay in blocks different disks different users disk arrays disk or link disks attached example exclusive-OR expected delay ﬁeld elements Figure ﬁnd ﬁrst follows Galois ﬁeld given information storage scheme information vector integer invertible function Lemma linearly independent set link failures m-tuples X1 Markov chain matrix max-ﬂow modiﬁed network to admit node number of bits number of blocks number of disks parity blocks parity cylinder parity technique parity track possible values Proof proposition reconstruct recover X1 reliably recover s-t cut secret sharing set of disks skew stationary distribution storage capacity storage efficiency storage network storage sites store information superuser Suppose table overhead tbits total number triangular subset updated users U1