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

DOI10.1109/18.771248zbMATH Open0957.94050OpenAlexW2131409472MaRDI QIDQ4701436FDOQ4701436

Authors: Claude le Dantec, Ph. Piret 

Publication date: 21 November 1999

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.771248

Recommendations

• Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
• Subspace subcodes of generalized Reed-Solomon codes
• Subspace subcodes of Reed-Solomon codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• scientific article; zbMATH DE number 3963722
• The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes
• A Decoding Approach to Reed–Solomon Codes from Their Definition
• Generalized Reed-Muller codes over \({\mathbb{Z}_q}\)
• scientific article; zbMATH DE number 4070804
• Sequential decoding for a subcode of Reed Solomon codes

zbMATH Keywords

Reed-Solomon codenonsystematic encoderssubalphabet subcodessystematic encoders

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

This page was built for publication: An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701436)