skip to main content
column

What can coding theory do for storage systems?

Published:06 March 2013Publication History
Skip Abstract Section

Abstract

Storage systems and coding theory are two very different but highly interdependent engineering disciplines. The development of storage systems has impacted research in coding theory, and coding-theoretic contributions changed the way storage systems work. The presentation aims to give a short summary of the different problems solved by coding theory at the service of storage systems.

References

  1. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures," IEEE Transactions on Computers, vol. 44, no. 2, pp. 192--202, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Blaum, J. Bruck, and A. Vardy, "MDS array codes with independent parity symbols," IEEE Transactions on Information Theory, vol. 42, no. 2, pp. 529--542, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Blaum, P. Farrell, and H. van Tilborg, "Array codes," Handbook of Coding Theory, V.S. Pless and W.C. Huffman, pp. 1855--1909, 1998.Google ScholarGoogle Scholar
  4. M. Blaum and R. Roth, "New array codes for multiple phased burst correction," IEEE Transactions on Information Theory, vol. 39, no. 1, pp. 66--77, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. ______, "On lowest density MDS codes," IEEE Transactions on Information Theory, vol. 45, no. 1, pp. 46--59, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Blomer, M. Kalfane, M. Karpinski, R. Karp, M. Luby, and D. Zuckerman, "An XOR-based erasure-resilient coding scheme," TR-95-048, International Computer Science Institute, Tech. Rep., August 1995.Google ScholarGoogle Scholar
  7. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM'98, Vancouver BC,Canada, 1998, pp. 56--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Y. Cassuto and J. Bruck, "Cyclic lowest-density MDS array codes," IEEE Transactions on Information Theory, vol. 55, no. 4, pp. 1721--1729, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. ______, "Low-complexity array codes for random and clustered 4-erasures," IEEE Transactions on Information Theory, vol. 58, no. 1, pp. 146--158, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Y. Cassuto and M. A. Shokrollahi, "Array-code ensembles -or- two-dimensional LDPC codes," in Proc. of the IEEE International Symposium on Info. Theory, St. Petersburg Russia, 2011.Google ScholarGoogle Scholar
  11. ______, "On-line fountain codes for semi-random loss channels," in Proc. IEEE Information Theory Workshop, Paraty, Brazil, 2011.Google ScholarGoogle Scholar
  12. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar, "Rowdiagonal parity for double disk failure correction," in In Proceedings of the 3rd USENIX Conference on File and Storage Technologies, San-Francisco CA, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. A. Dimakis, P. Godfrey, Y. Wu, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4539--4551, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. P. Elias, "The binary erasure channel," MIT Information Theory Lectures, 1954.Google ScholarGoogle Scholar
  15. J. L. Fan, "Array codes as low-density parity check codes," in Proc. of the Intl. Symp. on Turbo Codes, 2000, pp. 543--546.Google ScholarGoogle Scholar
  16. P. Gopalan, C. Huang, H. Simitci, and S. Yekhanin, "On the locality of codeword symbols," ECCC: TR11-100, 2011, to appear in IEEE Trans. Info. Theory.Google ScholarGoogle Scholar
  17. C. Huang, M. Chen, and J. Li, "Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems," in In Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications, Cambridge, MA USA, 2007.Google ScholarGoogle Scholar
  18. C. Huang and L. Xu, "Star: An efficient coding scheme for correcting triple storage node failures," in In Proceedings of the 4th USENIX Conference on File and Storage Technologies, San-Francisco CA, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Louidor and R. Roth, "Lowest-density MDS codes over extension alphabets," IEEE Transactions on Information Theory, vol. 52, no. 7, pp. 3186--3197, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Luby, "LT codes," in Proc. of the Annual IEEE Symposium on Foundations of Computer Science FOCS, Vancouver BC, Canada, 2002, pp. 271--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. I. S. Reed and G. Solomon, "Polynomial codes over certain finite fields," SIAM J. Appl. Math., vol. 8, pp. 300--304, 1960.Google ScholarGoogle ScholarCross RefCross Ref
  22. T. Richardson and R. Urbanke, Modern coding theory. New York USA: Cambridge University Press, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. C. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27, no. 9, pp. 379--423, Oct. 1948.Google ScholarGoogle ScholarCross RefCross Ref
  24. M. A. Shokrollahi, "Raptor codes," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551--2567, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. I. Tamo, Z. Wang, and J. Bruck, "Zigzag codes: MDS array codes with optimal rebuilding," arXiv:1112.0371 {cs.IT}, 2011, submitted to IEEE Trans. Info. Theory, 10/2011.Google ScholarGoogle Scholar
  26. L. Xu, V. Bohossian, J. Bruck, and D. Wagner, "Low-density MDS codes and factors of complete graphs," IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 1817--1826, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. G. Zaitsev, V. Zinovév, and N. Semakov, "Minimum-check-density codes for correcting bytes of errors, erasures, or defects," Problems Inform. Transm., vol. 19, pp. 197--204, 1981.Google ScholarGoogle Scholar

Index Terms

  1. What can coding theory do for storage systems?

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM SIGACT News
            ACM SIGACT News  Volume 44, Issue 1
            March 2013
            109 pages
            ISSN:0163-5700
            DOI:10.1145/2447712
            Issue’s Table of Contents

            Copyright © 2013 Author

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 6 March 2013

            Check for updates

            Qualifiers

            • column

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader