By Topic

Properties of Transparent Shortened Codes for Memories With Stuck-at Faults

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sundberg, C.-E. ; 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.

Published in:

Computers, IEEE Transactions on  (Volume:C-28 ,  Issue: 9 )