scientific article; zbMATH DE number 3861057

MaRDI QIDQ3329378zbMATH OpenFDO

Authors

Publication date 1981

zbMATH Keywords

arithmetic of GF(p)fields of non-binary characteristicGalois field arithmeticmodular arithmeticpolynomial operationsReed-Solomon codes

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Recommendations

• scientific article; zbMATH DE number 3859036
• Arithmetic of binary finite fields
• Binary fields on limited systems
• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• Complexity of computation in finite fields

Cited in

(13)

• Handbook of finite fields
• Binary fields on limited systems
• Arithmetic of binary finite fields
• scientific article; zbMATH DE number 3859036 (Why is no real title available?)
• A redundant representation of GF(qⁿ) for designing arithmetic circuits
• scientific article; zbMATH DE number 3961485 (Why is no real title available?)
• scientific article; zbMATH DE number 4008269 (Why is no real title available?)
• Implementing Exact Calculations in Hardware
• scientific article; zbMATH DE number 1135079 (Why is no real title available?)
• scientific article; zbMATH DE number 1985649 (Why is no real title available?)
• scientific article; zbMATH DE number 1796154 (Why is no real title available?)
• scientific article; zbMATH DE number 5241977 (Why is no real title available?)
• On arithmetical algorithms over finite fields

This page was built for publication:

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