메뉴 건너뛰기




Volumn 57, Issue 6, 2011, Pages 3692-3697

Position modulation code for rewriting write-once memories

Author keywords

Flash memories; position modulation; write once memories

Indexed keywords

CODE RATES; LOW COMPLEXITY CODING; MODULATION CODES; OPTICAL DISKS; OPTIMAL RATE; POSITION MODULATION; PRACTICAL SOLUTIONS; STORAGE MEDIUM; WRITE ONCE;

EID: 79957642957     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2134370     Document Type: Article
Times cited : (26)

References (25)
  • 1
    • 0028430754 scopus 로고
    • On multiuser write-efficient memories
    • R. Ahlswede and Z. Zhang, "On multiuser write-efficient memories," IEEE Trans. Inf. Theory, vol. 40, no. 3, pp. 674-686, 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.3 , pp. 674-686
    • Ahlswede, R.1    Zhang, Z.2
  • 4
    • 0015565580 scopus 로고
    • Enumerative source coding
    • Jan.
    • T. M. Cover, "Enumerative source coding," IEEE Trans. Inf. Theory, vol. IT-19, no. 1, pp. 73-77, Jan. 1973.
    • (1973) IEEE Trans. Inf. Theory , vol.IT-19 , Issue.1 , pp. 73-77
    • Cover, T.M.1
  • 5
    • 0021428073 scopus 로고
    • Generalized 'write-once' memories
    • May
    • A. Fiat and A. Shamir, "Generalized 'write-once' memories," IEEE Trans. Inf. Theory, vol. IT-30, no. 3, pp. 470-480, May 1984.
    • (1984) IEEE Trans. Inf. Theory , vol.IT-30 , Issue.3 , pp. 470-480
    • Fiat, A.1    Shamir, A.2
  • 7
    • 0032635971 scopus 로고    scopus 로고
    • On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph
    • Jan.
    • F. Fu and A. J. H. Vinck, "On the capacity of generalized write-once memory with state transitions described by an arbitrary directed acyclic graph," IEEE Trans. Inf. Theory, vol. 45, no. 1, pp. 308-313, Jan. 1999.
    • (1999) IEEE Trans. Inf. Theory , vol.45 , Issue.1 , pp. 308-313
    • Fu, F.1    Vinck, A.J.H.2
  • 8
    • 0034315067 scopus 로고    scopus 로고
    • On the capacity and error-correcting codes of write-efficient memories
    • DOI 10.1109/18.887845
    • F. Fu and R. W. Yeung, "On the capacity and error-correcting codes of write-efficient memories," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2299-2314, Nov. 2000. (Pubitemid 32090014)
    • (2000) IEEE Transactions on Information Theory , vol.46 , Issue.7 , pp. 2299-2314
    • Fu, F.-W.1    Yeung, R.W.2
  • 9
    • 0028546772 scopus 로고
    • On the general defective channel with informed encoder and capacities of some constrained memories
    • A. J. H. Vinck and A. V. Kuznetsov, "On the general defective channel with informed encoder and capacities of some constrained memories," IEEE Trans. Inf. Theory, vol. 40, no. 6, pp. 1866-1871, 1994.
    • (1994) IEEE Trans. Inf. Theory , vol.40 , Issue.6 , pp. 1866-1871
    • Vinck, A.J.H.1    Kuznetsov, A.V.2
  • 10
    • 0021818141 scopus 로고
    • On the capacity of permanent memory
    • Jan.
    • C. D. Heegard, "On the capacity of permanent memory," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 34-42, Jan. 1985.
    • (1985) IEEE Trans. Inf. Theory , vol.IT-31 , Issue.1 , pp. 34-42
    • Heegard, C.D.1
  • 11
    • 0020821981 scopus 로고
    • On the capacity of computer memory with defects
    • Sep.
    • C. D. Heegard and A. A. E. Gamal, "On the capacity of computer memory with defects," IEEE Trans. Inf. Theory, vol. IT-29, no. 5, pp. 731-739, Sep. 1983.
    • (1983) IEEE Trans. Inf. Theory , vol.IT-29 , Issue.5 , pp. 731-739
    • Heegard, C.D.1    Gamal, A.A.E.2
  • 12
    • 51649104676 scopus 로고    scopus 로고
    • Floating codes for joint information storage in write asymmetric memories
    • Nice, France Jun.
    • A. Jiang, V. Bohossian, and J. Bruck, "Floating codes for joint information storage in write asymmetric memories," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Nice, France, Jun. 2007, pp. 1166-1170.
    • (2007) Proc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 1166-1170
    • Jiang, A.1    Bohossian, V.2    Bruck, J.3
  • 16
    • 0000359937 scopus 로고
    • Sequence time coding for data compression
    • Oct.
    • T. J. Lynch, "Sequence time coding for data compression," Proc. IEEE, vol. 54, pp. 1490-1491, Oct. 1966.
    • (1966) Proc. IEEE , vol.54 , pp. 1490-1491
    • Lynch, T.J.1
  • 18
    • 51649126934 scopus 로고
    • WOMcodes constructed with projective geometries
    • F. Merkx,"WOMcodes constructed with projective geometries," Traitment du Signal, vol. 1, no. 2-2, pp. 227-231, 1984.
    • (1984) Traitment du Signal , vol.1 , Issue.2 , pp. 227-231
    • Merkx, F.1
  • 19
    • 0026155553 scopus 로고
    • The four cases of write unidirectional memory codes over arbitrary alphabets
    • W. M. C. J. van Overveld, "The four cases of write unidirectional memory codes over arbitrary alphabets," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 872-878, 1991.
    • (1991) IEEE Trans. Inf. Theory , vol.37 , Issue.3 , pp. 872-878
    • Van Overveld, W.M.C.J.1
  • 20
    • 0020190402 scopus 로고
    • How to reuse a 'write-once' memory
    • R. L. Rivest and A. Shamir, "How to reuse a 'write-once' memory," Inf. Control, vol. 55, pp. 1-19, 1982.
    • (1982) Inf. Control , vol.55 , pp. 1-19
    • Rivest, R.L.1    Shamir, A.2
  • 21
    • 0015346058 scopus 로고
    • An algorithm for source coding
    • May
    • J. P. M. Schalkwijk, "An algorithm for source coding," IEEE Trans. Inf. Theory, vol. IT-18, pp. 395-399, May 1972.
    • (1972) IEEE Trans. Inf. Theory , vol.IT-18 , pp. 395-399
    • Schalkwijk, J.P.M.1
  • 22
    • 0024668841 scopus 로고
    • On write-unidirectional memory codes
    • May
    • G. Simonyi, "On write-unidirectional memory codes," IEEE Trans. Inf. Theory, vol. 35, no. 3, pp. 663-667, May 1989.
    • (1989) IEEE Trans. Inf. Theory , vol.35 , Issue.3 , pp. 663-667
    • Simonyi, G.1
  • 25
    • 0026153180 scopus 로고
    • Error-correcting WOM-codes
    • May
    • G. Zémor and G. D. Cohen, "Error-correcting WOM-codes," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 730-734, May 1991.
    • (1991) IEEE Trans. Inf. Theory , vol.37 , Issue.3 , pp. 730-734
    • Zémor, G.1    Cohen, G.D.2


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