A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes

DOI10.1109/TC.1987.1676857MaRDI QIDQ3786398zbMATH OpenOpenAlexFDO

Authors Hirokazu Okano, Hideki Imai

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

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

zbMATH Keywords

BCH codesGalois fieldsLSIread-only memoriesReed-Solomon codes

Mathematics Subject Classification ID

Decoding (94B35)

Cited in

(4)

• Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6
• A decoding algorithm for triple-error-correcting binary BCH codes
• Using Tschirnhaus transformations to find roots in quintic polynomials over \(\mathbb{F}_{2^{m}}\)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)

Describes a project that uses

Uses Software

• SEC-DED

This page was built for publication: A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes

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