Holographic dispersal and recovery of information
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (5) , 1123-1124
- https://doi.org/10.1109/18.42233
Abstract
A simple scheme for dispersal and recovery of digital information based on the discrete Fourier transform is discussed. The author presents a different implementation of M.O. Rabin's (J. ACM, vol.36, no.2, p.335-48, Apr. 1989) scheme, whose recovery cost is O(log m+k) operations per character, assuming m=Θ(n); for example, when k=Θ(log n), this cost drops from O(m) to O(log m) per character. Since the implementation is based on the Fourier transform, it is termed holographicKeywords
This publication has 2 references indexed in Scilit:
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Greatest of the least primes in arithmetic progressions having a given modulusMathematics of Computation, 1979