W*M’s: A Survey Writing on Some Binary Memories with Constraints

  • G. D. Cohen
Part of the International Centre for Mechanical Sciences book series (CISM, volume 313)


We survey some constructions of codes and estimations of capacities for binary memories subject to constraints on transitions between states. The capacity is found for the special class of translation-invariant constraints.

A summarizing table is given for write-unidirectional memories, write-isolated memories, and writing on reluctant, defective or suspicious memories.


Discrete Math Allowed Transition Letter Criterion Good Block Linear Block Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. AHLSWEDE, Z. ZHANG, Coding for write-efficient memories, Inform. and Control, vol. 83, n°1 (1989) 80–97.Google Scholar
  2. [2]
    L.BASSALYGO, S.GELFAND and M.PINSKER, Coding for channels with localized errors, Oberwolfach Tagungsbericht 21 /1989, May 1989.Google Scholar
  3. [3]
    J.M. BORDEN, Coding for write-unidirectional memories, preprint.Google Scholar
  4. [4]
    G. COHEN, P. FRANKL, Good coverings of Hamming spaces with spheres, Discrete Math. 56 (1985) 125–131.CrossRefMATHMathSciNetGoogle Scholar
  5. [5]
    G. COHEN, P. GODLEWSKI and F. MERKX, Linear block codes for write-once memories, IEEE Trans. Inform. Theory, IT-32, n°5 (1986) 697–700.Google Scholar
  6. [6]
    G. COHEN, G. SIMONY!, Coding for write-unidirectional memories and conflict resolution, Discrete Applied Math. 24 (1989) 103–114.CrossRefMATHGoogle Scholar
  7. [7]
    G. COHEN, G. ZEMOR, Write-Isolated Memories, French-Israeli Conference on combinatorics and algorithms, Nov. 1988, Jerusalem, to appear in Discrete Math.Google Scholar
  8. [8]
    I.CSISZAR and J.KORNER, Information Theory Academic PressGoogle Scholar
  9. [9]
    M.R. FELLOWS, Encoding graphs in graphs, Ph.D. Dissertation, Univ-Calif. San Diego, Computer Science, 1985Google Scholar
  10. [10]
    C.HEEGARD and A.A. EL GAMAL, On the capacity of Computer Memory with Defects, IEEE Trans. on Inform. Theory, vol. IT-29, n°5, (1983) 731–739.Google Scholar
  11. [11]
    T. KLOVE, On Robinson’s coding problem, IEEE Trans. on Inform. Theory, IT-29, n°3 (1983) 450–454.Google Scholar
  12. [12]
    K.U. KOSCHNICK, Coding for Write-Unidirectional Memories, Oberwolfach Tagungsbericht 21 /1989, May 1989.Google Scholar
  13. [13]
    A.V. KUZNETSOV, Defective channels and defective memories, Oberwolfach Tagungsbericht 21 /1989, May 1989.Google Scholar
  14. [14]
    A.V. KUZNETSOV and B.S. TSYBAKOV, Coding in memories with defective cells, Probl. Peredachi, Inform., vol. 10, n°2 (1974) 52–60.Google Scholar
  15. [15]
    L. LOVASZ, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975) 383–390.CrossRefMATHMathSciNetGoogle Scholar
  16. [16]
    F.J. MACWILLIAMS and N.J.A. SLOANE, The Theory of Error-correcting Codes North-Holland, New-York, 1977.Google Scholar
  17. [17]
    W. M.C.J. van OVERVELD, The four cases of WUM-codes over arbitrary alphabets, submitted to IEEE Trans.on Inform. Theory.Google Scholar
  18. [18]
    R.L. RIVEST, A. SHAMIR, How to reuse a “write-once” memory, Inform. and Control 55 (1982) 1–19.CrossRefMATHMathSciNetGoogle Scholar
  19. [19]
    M.R. SCHROEDER, Number Theory in Science and Communication. Springer-Verlag Series in Information Sciences, 1984.Google Scholar
  20. [20]
    G. SIMONY!, On Write-Unidirectional Memory Codes, IEEE Trans. on Inform. Theory, vol. 35, n°3 (1989) 663–669.Google Scholar
  21. [21]
    A. VINCK, personal communication. Google Scholar
  22. [22]
    H.S. WITSENHAUSEN and A.D. WYNER, On Storage Media with Aftereffects, Inform. and Control, 56 (1983), 199–211.CrossRefMATHMathSciNetGoogle Scholar
  23. [23]
    J.K. WOLF, A.D. WYNER, J. ZIV, J. KÖRNER, Coding for write-once memory, AT and T Bell Lab.-Tech. J. 63, N°6 (1984) 1089–112.Google Scholar

Copyright information

© Springer-Verlag Wien 1990

Authors and Affiliations

  • G. D. Cohen
    • 1
  1. 1.Télécom Paris and CNRS URA 820ParisFrance

Personalised recommendations