By Topic

An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)

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)
C. Le Dantec ; Inf. & Modulation Dept., Canon Res. Centre, France ; P. Piret

One describes procedures to generate the codewords of a Reed-Solomon code over GF(2m) having all their symbols in a GF(2) subspace of GF(2m). Some of the described encoders are systematic binary encoders and some are only partly systematic

Published in:

IEEE Transactions on Information Theory  (Volume:45 ,  Issue: 5 )