Skip to main content

Distributive Information Storage

  • Chapter
  • First Online:
  • 616 Accesses

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 15))

Abstract

The distribution of information occurs in various situations. Two well-known examples are parallel processing and secret sharing schemes. In parallel computers the data are distributed among the processors in order to speed up the computation. In secret sharing schemes portions of the secret key are distributed among several people in such a way that only a coalition of at least \( k \) of them is able to reconstruct the key.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. R.C. Singleton, Maximum distance \(q\)-ary codes. IEEE Trans. Inform. Theory 10, 116–118 (1964)

    Article  MathSciNet  Google Scholar 

  2. W.H.R. Equitz, Sequential refinement of information. Ph.D. thesis, Stanford University (1989)

    Google Scholar 

  3. W.H.R. Equitz, T.M. Cover, Succession refinement of information. IEEE Trans. Inform. Theory 37(2) (1991)

    Article  MathSciNet  Google Scholar 

  4. B.E. Clark et al., Parity spreading to enhance storage access, United States Patent, Patent number 4,761,785 (1988)

    Google Scholar 

  5. F.D. Lawlor, Efficient mass storage parity recovering mechanism. IBM Tech. Discl. Bullitin 24(2), 986–987 (1981)

    Google Scholar 

  6. D. Paterson et al., Reliable arrays of inexpensive discs (RAID), in ACM SIGMOD Conference 1988, Chicago (1988)

    Google Scholar 

  7. J. Menon, J. Kasson, Methods for improved update performance of disk arrays, Research Report RJ 6928 (66034), IBM Research Division (1989)

    Google Scholar 

  8. R.A. Brualdi, Introductory Combinatorics, 4th edn. (Pearson/Prentice-Hall, Upper Saddle River, 2004)

    Google Scholar 

  9. G. Berman, K.D. Fryer, Introduction to Combinatorics (Academic Press, NY, 1972)

    Chapter  Google Scholar 

  10. R.E. Blahut, Theory and Practice of Error Control Codes (Addison-Wesley, Reading, 1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rudolf Ahlswede .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ahlswede, R. (2019). Distributive Information Storage. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Probabilistic Methods and Distributed Information. Foundations in Signal Processing, Communications and Networking, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-030-00312-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00312-8_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00310-4

  • Online ISBN: 978-3-030-00312-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics