| |
- R. L. Rivest and A. Shamir, "How to reuse a write-once memory", Inform. Contr., vol. 55, pp. 1-19, 1982.
- Cohen, G. ; Godlewski, P. ; Merkx, F., “Linear binary code for write-once memories,” IEEE Transactions on Information Theory, vol. 32, no. 5, pp. 697 -700, 1986.
- Y. Wu and A. (Andrew) Jiang, ”Position Modulation Code for Rewriting Write-Once Memories”, IEEE Transactions on Information Theory, vol. 57, no. 6, pp. 3692 - 3697, 2011.
- E.Yaakobi, P.H. Siegel, A.Vardy, and J.K.Wolf, "Multiple error correcting WOM-codes", Proc. IEEE International Symposium on Information Theory, Austin, Texas, June 2010.
- B. Bose.and D. J. Lin " Systematic Unidirectional Error-Detecting Codes ", in IEEE trans. On Computers, C-34, no. 11, pp. 1026-1032, 1985.
- M. Blaum and J. Bruck, "Unordered Error-Correcting Codes and their Applications", Fault-Tolerant Computing, 1992. FTCS-22. Digest of Papers., Twenty-Second International Symposium on, Boston, MA, USA, 1992, pp. 486-493. doi: 10.1109/FTCS.1992.243585
- J. H. Patel, S. S. Lumetta and S. M. Reddy, "Application of Saluja-Karpovsky compactors to test responses with many unknowns," VLSI Test Symposium, 2003. Proceedings. 21st, 2003, pp. 107-112. doi: 10.1109/VTEST.2003.1197640
- M. G. Karpovsky and P. Nagvajara, "Optimal robust compression of test responses," in IEEE Transactions on Computers, vol. 39, no. 1, pp. 138-141, Jan 1990. doi: 10.1109/12.46290
- W. H. Kautz and R. C. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, 10(4):363377, 1964.
|
