An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
C. Le Dantec, Philippe Piret · IEEE Transactions on Information Theory · 1999
One describes procedures to generate the codewords of a Reed-Solomon code over GF(2/sup m/) having all their symbols in a GF(2) subspace of GF(2/sup m/). Some of the described encoders are systematic binary encoders and some are only partly systematic.