메뉴 건너뛰기




Volumn , Issue , 2010, Pages 864-868

Partial rank modulation for flash memories

Author keywords

[No Author keywords available]

Indexed keywords

CELL LEVELS; DECODING PROCESS; FLASH CELL; GRAY CODES; INFORMATION REPRESENTATION; MULTILEVEL FLASH MEMORY;

EID: 77955708044     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513597     Document Type: Conference Paper
Times cited : (12)

References (12)
  • 1
    • 66949120714 scopus 로고    scopus 로고
    • Rank modulation for flash memories
    • IEEE Transactions on June
    • A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck. Rank modulation for flash memories. Information Theory, IEEE Transactions on, 55(6):2659 2673, June 2009.
    • (2009) Information Theory , vol.55 , Issue.6 , pp. 2659-2673
    • Jiang, A.1    Mateescu, R.2    Schwartz, M.3    Bruck, J.4
  • 3
    • 51649104676 scopus 로고    scopus 로고
    • Floating codes for joint information storage in write asymmetric memories
    • A. Jiang, V. Bohossian, and J. Bruck. Floating codes for joint information storage in write asymmetric memories. Proc. IEEE ISIT, 2007.
    • (2007) Proc. IEEE ISIT
    • Jiang, A.1    Bohossian, V.2    Bruck, J.3
  • 5
    • 84976666253 scopus 로고
    • Loopless algorithms for generating permutations, combinations, and other combinatorial configurations
    • G. Ehrlich. Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. Journal of the ACM (JACM), 20(3):500-513, 1973.
    • (1973) Journal of the ACM (JACM) , vol.20 , Issue.3 , pp. 500-513
    • Ehrlich, G.1
  • 6
    • 0016452003 scopus 로고
    • A simplified loop-free algorithm for generating permutations
    • N. Dershowitz. A simplified loop-free algorithm for generating permutations. BIT Numerical Mathematics, 15(2):158-164, 1975.
    • (1975) BIT Numerical Mathematics , vol.15 , Issue.2 , pp. 158-164
    • Dershowitz, N.1
  • 7
    • 33747128854 scopus 로고
    • Universal cycles for combinatorial structures
    • R. Graham F. Chung, P. Diaconis. Universal cycles for combinatorial structures. Discrete Mathematics, 110(1-3):43-59, 1992.
    • (1992) Discrete Mathematics , vol.110 , Issue.1-3 , pp. 43-59
    • Graham, R.1    Chung, F.2    Diaconis, P.3
  • 8
    • 38249001278 scopus 로고
    • Universal cycles of k-subsets and k-permutations
    • B. W. Jackson. Universal cycles of k-subsets and k-permutations. Discrete mathematics, 117(1-3):141-150, 1993.
    • (1993) Discrete Mathematics , vol.117 , Issue.1-3 , pp. 141-150
    • Jackson, B.W.1
  • 9
    • 70349136456 scopus 로고    scopus 로고
    • Universal cycles for permutations
    • (in press)
    • J.R. Johnson. Universal cycles for permutations. Discrete Mathematics (in press), 2008.
    • (2008) Discrete Mathematics
    • Johnson, J.R.1
  • 10
    • 77955704706 scopus 로고    scopus 로고
    • An explicit universal cycle for the (n-1)-permutations of an n-set
    • Citeseer
    • F. Ruskey and A. Williams. An explicit universal cycle for the (n-1)-permutations of an n-set. In Talk at Napier Workshop. Citeseer, 2008.
    • (2008) Talk at Napier Workshop
    • Ruskey, F.1    Williams, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.