DocumentCode
1522683
Title
An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
Author
Le Dantec, Claude ; Piret, Philippe
Author_Institution
Inf. & Modulation Dept., Canon Res. Centre, France
Volume
45
Issue
5
fYear
1999
fDate
7/1/1999 12:00:00 AM
Firstpage
1697
Lastpage
1701
Abstract
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
Keywords
Galois fields; Reed-Solomon codes; GF(2m); GF(q); Reed-Solomon codes; codewords generation; encoder; partly systematic encoders; subalphabet; systematic binary encoders; Additives; Autobiographies; Computer science; Decoding; Error correction codes; Linear code; Mathematics; Propulsion; Reed-Solomon codes; USA Councils;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.771248
Filename
771248
Link To Document