On the capacity and error-correcting codes of write-efficient memories
暂无分享,去创建一个
[1] Philippe Langevin. Covering radius of RM (1, 9) in RM (3, 9) , 1990, EUROCODE.
[2] Rudolf Ahlswede,et al. On multiuser write-efficient memories , 1994, IEEE Trans. Inf. Theory.
[3] Chris Heegard. Partitioned linear block codes for computer memory with 'stuck-at' defects , 1983, IEEE Trans. Inf. Theory.
[4] Jack K. Wolf,et al. Coding for a write-once memory , 1984, AT&T Bell Laboratories Technical Journal.
[5] Gábor Simonyi,et al. On write-unidirectional memory codes , 1989, IEEE Trans. Inf. Theory.
[6] Adi Shamir,et al. How to Reuse a "Write-Once" Memory , 1982, Inf. Control..
[7] R. Ahlswede,et al. Coding for Write-Efficient Memory , 1989, Inf. Comput..
[8] Kees Schouhamer-Immink. Coding Techniques for Digital Recorders , 1991 .
[9] Rudolf Ahlswede,et al. Creating Order in Sequence Spaces with Simple Machines , 1990, Inf. Comput..
[10] P. Langevin. The covering radius of R(1,9) in R(3,9) , 1989 .
[11] Gérard D. Cohen,et al. A nonconstructive upper bound on covering radius , 1983, IEEE Trans. Inf. Theory.
[12] Xiang-dong Hou. On the covering radius of R(1, m) in R(3, m) , 1996, IEEE Trans. Inf. Theory.
[13] A. Fiat,et al. Generalized 'write-once' memories , 1984, IEEE Trans. Inf. Theory.
[14] Gérard D. Cohen,et al. Applications of coding theory to communication combinatorial problems , 1990, Discret. Math..
[15] Rudolf Ahlswede,et al. Models of Multi-User Write-Efficient Memories and General Diametric Theorems , 1997, Inf. Comput..
[16] Gérard D. Cohen,et al. Linear binary code for write-once memories , 1986, IEEE Trans. Inf. Theory.
[17] Luisa Gargano,et al. Qualitative Independence and Sperner Problems for Directed Graphs , 1992, J. Comb. Theory, Ser. A.
[18] Tom Høholdt,et al. Maxentropic Markov chains , 1984, IEEE Trans. Inf. Theory.
[19] Luisa Gargano,et al. Sperner capacities , 1993, Graphs Comb..
[20] Gérard D. Cohen,et al. Error-correcting WOM-codes , 1991, IEEE Trans. Inf. Theory.
[21] Gérard D. Cohen,et al. Covering radius 1985-1994 , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[22] Philippe Langevin. On the Orphans and Covering Radius of the Reed-Muller Codes , 1991, AAECC.
[23] A. J. Han Vinck,et al. On the Capacity of Generalized Write-Once Memory with State Transitions Described by an Arbitrary Directed Acyclic Graph , 1999, IEEE Trans. Inf. Theory.