The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1979 vol.28)
pp: 686-690
C.-E. Sundberg , Telecommunication Theory, University of Lund
ABSTRACT
This correspondence deals with the problem of selecting optimal shortened d = 3 Hamming codes and d = 4 extended Hamming codes. The studied codes are transparent codes, minimum column weight codes, and codes with a minimum number of codewords of minimum weight. It is concluded that a shortened code normally does not combine the properties of being transparent, being of minimum column weight type and having a minimum number of codewords of minimum weight. Furthermore, it is concluded that the weight distribution of a shortened code depends on the selected set of shortened information symbols for a given fixed number of shortened symbols. The correspondence also gives examples of good 22, 16 codes.
INDEX TERMS
stuck-at fault, Erasure and error decoding, erasure correcting code, error correcting code, transparent code, fault-tolerant system, Hamming code
CITATION
C.-E. Sundberg, "Properties of Transparent Shortened Codes for Memories With Stuck-at Faults", IEEE Transactions on Computers, vol.28, no. 9, pp. 686-690, September 1979, doi:10.1109/TC.1979.1675438
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool