By Topic

Comments on "Weighted sum codes for error detection and their comparison with existing codes"

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
$33 $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)
P. Farkas ; Fac. of Electr. Eng., Slovak Tech. Univ., Bratislava, Slovakia

A.J. McAuley (IEEE/ACM Trans. Networking, vol.2, p.16-22, 1994) proposed a new family of error detection codes called weighted sum codes. In the present paper it is noted, that these codes are equivalent to lengthened Reed Solomon codes, resp. shortened version of lengthened Reed Solomon codes over GF(2/sup h/2/). It is also shown, that it is possible to use these codes for error correction of one error in the code word over GF(2/sup h/2/).<>

Published in:

IEEE/ACM Transactions on Networking  (Volume:3 ,  Issue: 2 )