Reliable memories with subline accesses

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 2531-2535

  Han, Junsheng ^a   Lastras Montaño, Luis Alfonso ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CONTROL CODES; INTERNATIONAL SYMPOSIUM;

CODES (SYMBOLS); COMPUTER NETWORKS; CONTROL THEORY; CYBERNETICS; DATA STORAGE EQUIPMENT; ERROR CORRECTION; ERROR DETECTION; INFORMATION THEORY; REDUNDANCY; TECHNICAL PRESENTATIONS;

RELIABILITY;

EID: 51649086065     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557599     Document Type: Conference Paper

References (7)

1. M. Hassner, K. Abdel-Ghaffar, A. Patel, R. Koetter, and B. Trager, "Integrated interleaving - a novel ECC architecture," IEEE Trans. Magn., vol. 37, no. 2, pp. 773-775, 2001.
2. E. L. Blokh and V. V. Zyablov, "Coding of generalized concatenated codes," Problems of Information Transmission, vol. 10, no. 3, pp. 45-50, 1974.
3. J. K. Wolf, "On codes derivable from the tensor product of check matrices," IEEE Trans. Inform. Theory, vol. 11, no. 2, pp. 281-284, Apr. 1965.
4. J. Maucher, V. V. Zyablov, and M. Bossert, "On the equivalence of generalized concatenated codes and generalized error location codes," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 642-649, Feb. 2000.
5. M. A. De Boer, "Almost MDS codes," Designs, Codes and Cryptography, vol. 9, pp. 143-155, 1996.
6. A. E. Brouwer. Bounds on the minimum distance of linear codes. [Online]. Available: http://www.win.tue.nl/aeb/voorlincod.html
7. J. Bierbrauer and Y. Edel, "Extending and lengthening BCH-codes," Finite Fields and Their Applications, vol. 3, pp. 314-333, 1997.