scientific article; zbMATH DE number 3859036

MaRDI QIDQ3328458zbMATH OpenFDO

Authors

Publication date 1981

zbMATH Keywords

Reed-Solomon codesmodular arithmeticnormal basespolynomial operationsGalois fieldbinary logicarithmetic of finite fieldshigh-speed decoding

Mathematics Subject Classification ID

Cyclic codes (94B15) Arithmetic theory of polynomial rings over finite fields (11T55)

Recommendations

• scientific article; zbMATH DE number 3861057
• Arithmetic of binary finite fields
• Bit-parallel arithmetic implementations over finite fields \(\text{GF}(2^m)\) with reconfigurable hardware
• VLSI Architectures for Computing Multiplications and Inverses in GF(2^m)
• A survey on normal bases over finite fields

Cited in

(14)

• scientific article; zbMATH DE number 6258008 (Why is no real title available?)
• scientific article; zbMATH DE number 2109513 (Why is no real title available?)
• scientific article; zbMATH DE number 3861057 (Why is no real title available?)
• scientific article; zbMATH DE number 4170840 (Why is no real title available?)
• scientific article; zbMATH DE number 218558 (Why is no real title available?)
• Cyclotomy and its application to duadic codes
• Some minimal cyclic codes over finite fields
• scientific article; zbMATH DE number 3700718 (Why is no real title available?)
• Circular codes, loop counting, and zeta-functions
• Arithmetic of binary finite fields
• Theoretical bases, methods, and processors for transforming information in Galois field codes on the basis of the vertical information technology
• Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
• Cyclic Codes and Reducible Additive Equations
• scientific article; zbMATH DE number 7434616 (Why is no real title available?)

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 Q3328458)