Skip to main content
SpringerLink
Log in

New Approaches for Context Sensitive Flash Codes

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11601))

Included in the following conference series:

Abstract

Rewriting codes for flash memory enable the multiple usage of the same storage space, under the constraint that 0-bits can be changed into 1-bits, but not vice versa. Context sensitive rewriting codes extend this idea by incorporating also information gathered from surrounding bits. Several new and better context sensitive rewriting codes based on automata are presented and analyzed. Empirical simulations show a good match with the theoretical results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Notes

  1. 1.

    http://yann.lecun.com/exdb/mnist/.

  2. 2.

    http://pizzachili.dcc.uchile.cl/texts.html.

References

  1. Assar, M., Nemazie, S., Estakhri, P.: Flash memory mass storage architecture. US Patent 5,388,083, issued Feb. 7 1995 (1995). https://patentscope.wipo.int/search/en/detail.jsf?docId=WO1994023369

  2. Gal, E., Toledo, S.: Algorithms and data structures for flash memories. ACM Comput. Surv. 37(2), 138–163 (2005). https://doi.org/10.1145/1089733.1089735

    Article  Google Scholar 

  3. Jiang, A., Bohossian, V., Bruck, J.: Rewriting codes for joint information storage in flash memories. IEEE Trans. Inf. Theory 56(10), 5300–5313 (2010)

    Article  MathSciNet  Google Scholar 

  4. Klein, S.T.: Should one always use repeated squaring for modular exponentiation? Inf. Process. Lett. 106(6), 232–237 (2008). https://doi.org/10.1016/j.ipl.2007.11.016

    Article  MathSciNet  MATH  Google Scholar 

  5. Klein, S.T., Ben-Nissan, M.K.: On the usefulness of Fibonacci compression codes. Comput. J. 53(6), 701–716 (2010). https://doi.org/10.1093/comjnl/bxp046

    Article  Google Scholar 

  6. Klein, S.T., Shapira, D.: Boosting the compression of rewriting on flash memory. In: Bilgin, A., Marcellin, M.W., Serra-Sagristà, J., Storer, J.A. (eds.) DCC 2014, pp. 193–202. IEEE (2014)

    Google Scholar 

  7. Klein, S.T., Shapira, D.: Context sensitive rewriting codes for flash memory. Comput. J. 62(1), 20–29 (2019). https://doi.org/10.1093/comjnl/bxy020

    Article  MathSciNet  Google Scholar 

  8. Kurkoski, B.M.: Rewriting codes for flash memories based upon lattices, and an example using the E8 lattice. In: ACTEMT 2010, pp. 1861–1865. IEEE (2010). https://doi.org/10.1109/GLOCOMW.2010.5700264

  9. Rivest, R.L., Shamir, A.: How to reuse a ‘write-once’ memory. Inf. Control 55(1–3), 1–19 (1982). https://doi.org/10.1016/S0019-9958(82)90344-8

    Article  MathSciNet  MATH  Google Scholar 

  10. Shpilka, A.: New constructions of WOM codes using the Wozencraft ensemble. IEEE Trans. Inf. Theory 59(7), 4520–4529 (2013)

    Article  MathSciNet  Google Scholar 

  11. Yaakobi, E., Kayser, S., Siegel, P.H., Vardy, A., Wolf, J.K.: Codes for write-once memories. IEEE Trans. Inf. Theory 58(9), 5985–5999 (2012)

    Article  MathSciNet  Google Scholar 

  12. Zeckendorf, E.: Représentation des nombres naturels par une somme des nombres de Fibonacci ou de nombres de Lucas. Bull. Soc. Roy. Sci. Liège 41, 179–182 (1972)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Bar Ilan University, 52900, Ramat Gan, Israel

    Gilad Baruch & Shmuel T. Klein

  2. Deparment of Computer Science, Ariel University, 40700, Ariel, Israel

    Dana Shapira

Authors
  1. Gilad Baruch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shmuel T. Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dana Shapira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dana Shapira .

Editor information

Editors and Affiliations

  1. Slovak Academy of Sciences, Košice, Slovakia

    Michal Hospodár

  2. Slovak Academy of Sciences, Košice, Slovakia

    Galina Jirásková

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baruch, G., Klein, S.T., Shapira, D. (2019). New Approaches for Context Sensitive Flash Codes. In: Hospodár, M., Jirásková, G. (eds) Implementation and Application of Automata. CIAA 2019. Lecture Notes in Computer Science(), vol 11601. Springer, Cham. https://doi.org/10.1007/978-3-030-23679-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23679-3_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23678-6

  • Online ISBN: 978-3-030-23679-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation