By Topic

On the undetected error probability of binary expansions of Reed-Solomon 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

2 Author(s)
Kaiming Ho ; Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC ; C. Leung

It has been shown by Kasami and Lin (see IEEE Trans. Commun., vol.32, p.998, 1984) that (n,k) Reed-Solomon codes used over a q-ary symmetric channel are proper. In this correspondence, it is shown that the binary expansions of these codes and their extensions, when used on the binary-symmetric channel, are not necessarily proper. In particular, certain codes of rate less than [1-log2m+{(m-1)/m}log2 (m-1)] where m=log2 q are not proper

Published in:

IEEE Transactions on Information Theory  (Volume:42 ,  Issue: 4 )