Skip to main content
Log in

Gray codes over certain run-length sequences for local rank modulation

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

In the local rank modulation (LRM) scheme, a sliding window produces a sequence of permutations by moving over a sequence of variables. LRM has been presented as a method of storing data in flash memory, which represents a natural generalization of the classical rank modulation scheme. In this paper, we present a study on Gray codes over certain run-length sequences for the (1, 2, n)-LRM scheme to simulate virtual multilevel flash memory cells while maintaining the advantages of LRM. Unlike previous studies on the LRM scheme, we present Gray codes over certain run-length sequences in the (1, 2, n)-LRM scheme. This class of Gray codes can overcome the drawback of the many distinct charge levels required in the rank modulation scheme and in certain Gray codes for LRM. Furthermore, we demonstrate that the proposed codes have an asymptotically optimal rate.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Jiang A X, Mateescu R, Schwartz M, et al. Rank modulation for flash memories. IEEE Trans Inform Theor, 2009, 55: 2659–2673

    Article  MathSciNet  MATH  Google Scholar 

  2. Jiang A X, Schwartz M, Bruck J. Correcting charge-constrained errors in the rank-modulation scheme. IEEE Trans Inform Theor, 2010, 56: 2112–2120

    Article  MathSciNet  MATH  Google Scholar 

  3. Tamo I, Schwartz M. Correcting limited-magnitude errors in the rank-modulation scheme. IEEE Trans Inform Theor, 2010, 56: 2551–2560

    Article  MathSciNet  MATH  Google Scholar 

  4. Wang Z Y, Jiang A X, Bruck J. On the capacity of bounded rank modulation for flash memories. In: Proceedings of IEEE International Symposium Information Theory, Seoul, 2009. 1234–1238

    Google Scholar 

  5. Gray F. Pulse Code Communication. U. S. Patent, 2632058, 1953, 17

    Google Scholar 

  6. Chang C C, Chen H Y, Chen C Y. Symbolic gray code as a data allocation scheme for two-disc systems. Comput J, 1992, 35: 299–305

    Article  MATH  Google Scholar 

  7. Chen M S, Shin K G. Subcube allocation and task migration in hypercube multiprocessors. IEEE Trans Comput, 1990, 39: 1146–1155

    Article  Google Scholar 

  8. Ludman J. Gray code generation for MPSK signals. IEEE Trans Commun, 1981, 29: 1519–1522

    Article  Google Scholar 

  9. Richards D. Data compression and Gray-code sorting. Inf Process Lett, 1986, 22: 201–205

    Article  MathSciNet  MATH  Google Scholar 

  10. Savage C D. A survey of combinatorial Gray codes. SIAM Rev, 1997, 39: 605–629

    Article  MathSciNet  MATH  Google Scholar 

  11. En Gad E, Langberg M, Schwartz M, et al. Generalized Gray codes for local rank modulation. IEEE Trans Inform Theor, 2013, 59: 6664–6673

    Article  MathSciNet  MATH  Google Scholar 

  12. En Gad E, Langberg M, Schwartz M, et al. Constant-weight Gray codes for local rank modulation. IEEE Trans Inform Theor, 2011, 57: 7431–7442

    Article  MathSciNet  MATH  Google Scholar 

  13. Farnoud F, Skachek V, Milenkovic O. Error-correction in flash memories via codes in the Ulam metric. IEEE Trans Inform Theor, 2013, 59: 3003–3020

    Article  MathSciNet  MATH  Google Scholar 

  14. Horovitz M, Etzion T. Constructions of snake-in-the-box codes for rank modulation. IEEE Trans Inform Theor, 2014, 60: 7016–7025

    Article  MathSciNet  MATH  Google Scholar 

  15. Ge G N, Zhang Y W. Snake-in-the-box codes for rank modulation under Kendall’s-metric. IEEE Trans Inform Theor, 2016, 62: 151–158

    Article  MATH  Google Scholar 

  16. Yehezkeally Y, Schwartz M. Snake-in-the-box codes for rank modulation. IEEE Trans Inform Theor, 2012, 58: 5471–5483

    Article  MathSciNet  MATH  Google Scholar 

  17. Laisant C A. Sur la numération factorielle, application aux permutations. Bull de la Société Mathématiq. de France, 1888, 16: 176–183

    Article  MathSciNet  MATH  Google Scholar 

  18. Ferreira H C, Vinck A J H, Swart T G, et al. Permutation trellis codes. IEEE Trans Commun, 2005, 53: 1782–1789

    Article  Google Scholar 

  19. Blake I F. The enumeration of certain run length sequences. Inf Control, 1982, 55: 222–237

    Article  MathSciNet  MATH  Google Scholar 

  20. Kautz W H. Fibonacci codes for synchronization control. IEEE Trans Inform Theor, 1965, 11: 284–292

    Article  MathSciNet  MATH  Google Scholar 

  21. Golomb S W. Shift Register Sequences. San Francisco: Holden-Day, 1967

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by National Basic Research Program of China (973) (Grant No. 2013CB834204) and National Natural Science Foundation of China (Grant No. 61571243).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiang Wang.

Additional information

Invited article

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, X., Fu, FW. Gray codes over certain run-length sequences for local rank modulation. Sci. China Inf. Sci. 61, 100305 (2018). https://doi.org/10.1007/s11432-018-9509-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-018-9509-y

Keywords

Navigation