This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Properties of Transparent Shortened Codes for Memories With Stuck-at Faults
September 1979 (vol. 28 no. 9)
pp. 686-690
C.-E. Sundberg, Telecommunication Theory, University of Lund
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, Sept. 1979, doi:10.1109/TC.1979.1675438
Usage of this product signifies your acceptance of the Terms of Use.